Better way to sort array in descending order

Question

I have a array of int which I have to sort by descending.

Since I did not find any method to sort the array in descending order.Currently I am sorting the array in descending order as below

int[] array = new int[] { 3, 1, 4, 5, 2 }; Array.Sort<int>( array ); Array.Reverse( array ); 

Now,the question is that.Is there any better way to do the same in c#?

Answer 1

Use LINQ OrderByDescending method. It returns IOrderedIEnumerable<int>, which you can convert back to Array if you need so. Generally, List<>s are more functional then Arrays.

array = array.OrderByDescending(c => c).ToArray(); 

Answer 2

Depending on the sort order, you can do this :

    int[] array = new int[] { 3, 1, 4, 5, 2 };     Array.Sort<int>(array,                     new Comparison<int>(                             (i1, i2) => i2.CompareTo(i1)                     )); 

... or this :

    int[] array = new int[] { 3, 1, 4, 5, 2 };     Array.Sort<int>(array,                     new Comparison<int>(                             (i1, i2) => i1.CompareTo(i2)                     )); 

i1 and i2 are just reversed.