Fastest way to sort an array in descending order

Question

Why is the following code

Array.Sort(values);
Array.Reverse(values);

much faster at sorting an array in descending order compared to

<

Answer 1

Delegates.

The call to the delegate is much slower than the default call to IComparable.CompareTo

Update:

If you want the same (or close) speed, implement the IComparer interface and pass that to the sort method.

http://msdn.microsoft.com/en-us/library/bzw8611x