-
class
Sorter
implementation based on the merge-sort algorithm that merges in place (no extra
memory will be allocated).
class
Sorter
implementation based on a variant of the quicksort algorithm called
introsort: when the recursion level exceeds the
log of the length of the array to sort, it falls back to heapsort.
class
Radix sorter for variable-length strings.
class
Stable radix sorter for variable-length strings.
class
Get a fall-back sorter which may assume that the first k bytes of all compared strings are
equal.