<<Up
Contents
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:
http://www.cs.utexas.edu/users/EWD/ewd07xx/EWD796a.PDF
wikipedia.org
dumped 2003-03-17 with
terodump