Smoothsort
The
smoothsort sorting algorithm is a variation of
heapsort developed by
Edsger Dijkstra. The advantage of smoothsort is that it works in O(n) time if the input is (almost) sorted. Due to the extra complexity it is rarely used.
External references: