Smoothsort

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.

References

 

<< PreviousWord BrowserNext >>
wymondham abbey
wymondham
saloum
robert plant
protected area
protected areas of the united kingdom
protected areas of the european union
natura 2000
tony benn
omdurman
lynching
casamance
profumo affair
number 13
biffeche
bethio
venetian slovenia
t2
hua guofeng
round tower
t4
wingspan
the anarchy
sheringham park
cayor
snettisham
the wash
kenneth clarke
defense intelligence agency
super mario land 2: 6 golden coins
edvard westermarck
matrox
chili
deiodinase
jrgen skafte rasmussen
filter (unix)
radio controlled model
jennifer warnes
bureau of international expositions
derbyshire wildlife trust
the e street shuffle
4th of july, asbury park (sandy)
kitty's back
wild billy's circus story
Copyright 2005-2009 OnPedia.com. All Rights Reserved