✦ LIBER ✦

Adaptive Heapsort

✍ Scribed by C. Levcopoulos; O. Petersson

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 697 KB
Volume: 14
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1993.1021

No coin nor oath required. For personal study only.

✦ Synopsis

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 measures appearing in the literature. Moreover, it has an interesting application in the sweepline technique in computational geometry. 1993 Academic Press, Inc.

📜 SIMILAR VOLUMES

The Analysis of Heapsort

✍ R. Schaffer; R. Sedgewick 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 990 KB

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

Adaptively supported adaptability

✍ Reinhard Oppermann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 790 KB

Adaptive Consequences

✍ Austin, Lucy L 📂 Fiction 📅 2020 🌐 en-US ⚖ 214 KB

Adaptive approximation

✍ John R Rice 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Adaptive filtering

✍ A.H. Jazwinski 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 691 KB

Applications of the Kalman filter in orbit determination problems have sometimes encountered a difficulty which has been referred to as divergence. The phenomenon is a growth in the residuals; the state and its estimate diverge. This problem can often be traced to insufficient accuracy in modeling t