What sorting algorithm does .net use in IComparer

Question

Does anyone know which sorting algorithm .net uses when we implement IComparerin our class?

Answer 1

QuickSort seems to have this.

IComparer documentation says

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

The Array.Sort documentation states

QuickSort. ; , , . , .

Answer 2

MSDN,.NET QuickSort. , ( ), .NET , ?

Answer 3

, Introsort, :

:

• 16 ,

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

• Otherwise, it uses the Quicksort algorithm .

  source here