IComparer中.net使用哪种排序算法

Question

当我们在类中实现IComparer时，有没有人知道.net使用了哪种排序算法？

Answer 1

QuickSort seems to be it.

The documentation on IComparer says

This interface is used in conjunction with the Array.Sort and Array.BinarySearch methods.

The Array.Sort documentation says

This method uses the QuickSort algorithm. This implementation performs an unstable sort; that is, if two elements are equal, their order might not be preserved. In contrast, a stable sort preserves the order of elements that are equal.

Answer 2

According to the MSDN , .NET uses QuickSort. By the way, the method absolutely doesn't depend on the comparer (as long as it's comparison-based), why should .NET therefore use a different method depending on whether you provide a custom comparer or not?

Answer 3

The current documentation says it uses a type of Introsort , a hybrid sorting algoritm:

Is works like this:

1. If the partition size is fewer than 16 elements, it uses an insertion sort algorithm

2. If the number of partitions exceeds 2 * LogN, where N is the range of the input array, it uses a Heapsort algorithm.

3. Otherwise, it uses a Quicksort algorithm.

   source here