Skip to content

Sorting

Bruno Fernandes edited this page Mar 24, 2019 · 1 revision

Generic sorting algorithms.

Algorithm Performance Comments
InsertionSort quadratic In-place stable sorting algorithm
MergeSort linearithmic Bottom-up sort implementation; stable; uses O(n) extra memory
QuickSort linearithmic (amortised) In-place implementation with three-way partitioning; unstable
HeapSort linearithmic In-place algorithm, but unstable and makes poor use of cache memory
Clone this wiki locally