Smoothsort (PDF)
A variant on Heapsort by Dijkstra that gives excellent performance on partially sorted sets, O(n) in the best case and O(nlogn) in the worst, with a graceful degradation inbetween.
A variant on Heapsort by Dijkstra that gives excellent performance on partially sorted sets, O(n) in the best case and O(nlogn) in the worst, with a graceful degradation inbetween.