We provide a sorting algorithm, Adaptive Heapsort, that optimally adapts to several known, and new, measures of presortedness. The algorithm is motivated by a new measure, called \(O s c\), which intuitively tells the oscillation within the input sequence. We show that Osc generalizes a number of me
The Analysis of Heapsort
โ Scribed by R. Schaffer; R. Sedgewick
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 990 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Although discovered some 30 years ago, the Heapsort algorithm is still not completely understood. Here we investigate the best case of Heapsort. Contrary to ลฝ . claims made by some authors that its time complexity is O n , i.e., linear in the ลฝ . number of items, we prove that it is actually O n log
regarding the manuscript are gratefully acknowledged. The operating cost of the Consortium is supported by a grant from the Cystic Fibrosis Foundation of the USA.
"Johannes Cabal, a necromancer of some little infamy, has come into possession of a vital clue that may lead him to his ultimate goal--a cure for death. The path is vague, however, and certainly treacherous as it takes him into strange territories that, quite literally, no one has ever seen before.