.NET的Array.Sort（）方法使用哪种排序算法？

Question

.NET的Array.Sort()方法使用哪种排序算法？

Answer 1

Array.Sort() chooses one of three sorting algorithm, depending on the size of the input:

1. If the size is fewer than 16 elements, it uses an insertion sort algorithm.
2. If the size exceeds 2 * log^N , where N is the range of the input array, it uses a Heap Sort algorithm.
3. Otherwise, it uses a Quicksort algorithm

Source: Array.Sort(Array) Method on MSDN .

Answer 2

It uses the QuickSort algorithm.

Source:

• Array.Sort Method _{(MSDN, Remarks section)}

Answer 3

Actually, It's not that easy as it's seems. It looks like .NET is implementing a set of different sorting algorithms depending on the input and his size. I used to decompile Array.Sort() from CLR and it seems that they are using both Heap, Insertion and Quicksort.

Answer 4

Quick sort as mentioned. But it does not equally well for all data!

By using reflector: it does sort in a native dll -> for the most common case of 1D arrays, ascending order. However, other cases are sorted in managed code - with very little optimizations applied. Hence their speed is usually much slower.

Answer 5

它使用快速排序进行排序