Which sorting algorithm is used by .net in IComparer
.net, algorithm, sorting
Solution
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.
Problem
Do any one know which sorting algorithm is used by .net when we implement `IComparer` in our class?