| Class | Description |
|---|---|
| InPlaceStableMergeSort<T> |
A stable merge sort implementation that uses at most O(log(n)) memory
and O(n*log(n)*log(n)) time.
|
| InPlaceStableQuicksort<T> |
A stable quicksort implementation that uses O(log(n)) memory.
|
Sorting utilities.