Definition: A variant of heapsort that takes advantage of a partially ordered table. Performance is O(n) when input is sorted and O(n log n) performance for worst case.
See also heapsort.
Note: From Lynn Milnes <firstname.lastname@example.org> August 2003
Edsger W. Dijkstra, An alternative to Heapsort for sorting in situ, manuscript, June 1981. PDF.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 4 October 2010.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "smoothsort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 4 October 2010. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/smoothsort.html