Encyclopedia > Smoothsort

Article Content

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

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

Dynabee

... will not simply fall over, but start precessing around. (The precessing motion is perpendicular to the torque trying to make the gyro fall over.) The axis of th ...