This module contains a sorting algorithm based on Orson Peters’ pattern-defeating quicksort, published at: https://github.com/orlp/pdqsort
Unstable sorting is compatible with core because it doesn’t allocate memory, unlike our stable sorting implementation.
In addition it also contains the core logic of the stable sort used by
slice::sort based on
vusing heapsort, which guarantees O(n * log(n)) worst-case.
indexis at its final sorted position.
vusing pattern-defeating quicksort, which is O(n * log(n)) worst-case.