If comparer is null, each element within the specified range of elements in array must implement the IComparable interface to be capable of comparisons with every other element in array.

If the sort is not successfully completed, the results are undefined.

This method uses the introspective sort (introsort) algorithm as follows:

• If the partition size is fewer than 16 elements, it uses an tp://en.wikipedia.org/wiki/Insertion_sort algorithm.

• If the number of partitions exceeds 2 * Log, where N is the range of the input array, it uses a tp://en.wikipedia.org/wiki/Heapsort algorithm.

• Otherwise, it uses a tp://en.wikipedia.org/wiki/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.

For arrays that are sorted by using the Heapsort and Quicksort algorithms, in the worst case, this method is an O(n log n) operation, where n is length.