✦ LIBER ✦

Average-case results on heapsort

✍ Scribed by Svante Carlsson

Book ID: 105404325
Publisher: Springer Netherlands
Year: 1987
Tongue: English
Weight: 815 KB
Volume: 27
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01937350

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Best Case of Heapsort

✍ B. Bollobás; T.I. Fenner; A.M. Frieze 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 169 KB

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

Best case lower bounds for Heapsort

✍ Y. Ding; M. A. Weiss 📂 Article 📅 1992 🏛 Springer Vienna 🌐 English ⚖ 537 KB

Average-case results for zero finding

✍ Erich Novak 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Comment on "Some New Results on Average

Comment on "Some New Results on Average Worst Case Carry"

✍ Yuen, C.K. 📂 Article 📅 1974 🏛 IEEE 🌐 English ⚖ 220 KB

Worst-case analysis of a generalized hea

Worst-case analysis of a generalized heapsort algorithm

✍ A. Paulik 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Adaptive Heapsort

✍ C. Levcopoulos; O. Petersson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 697 KB

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