Smoothsort

From Free net encyclopedia

Revision as of 17:29, 21 March 2006; view current revision
←Older revision | Newer revision→

The smoothsort sorting algorithm is a variation of heapsort developed by Edsger Dijkstra in 1981. 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.

[edit]

References

Template:Compu-sci-stub

Retrieved from "http://www.netipedia.com/index.php/Smoothsort"