Showing papers on "Binary heap published in 1989"
[...]
TL;DR: An algorithm to construct a heap which uses on average (α + o(1))n comparisons to build a heap on n elements, where α ≈ 1.52, which is better than that known for any other algorithm.
67 citations
TL;DR: It is shown that to construct an implicit, double-ended priority queue organized as a min-max heap, 17/9n = 1.88 ...n comparisons suffice in the worst case (neglectng lower order terms) and the algorithm improves the previously best known upper bound.
Abstract: In this paper we show that to construct an implicit, double-ended priority queue organized as a min-max heap, 17/9n = 1.88 ...n comparisons suffice in the worst case (neglectng lower order terms). The algorithm improves the previously best known upper bound of 2.15 ...n comparisons.
7 citations
17 Aug 1989
TL;DR: It is shown that the k th smallest element in a large heap is at expected depth ≤log k, and simulation results indicate that this bound is tight, and that the variance of the depth is no more than 0.8, independent of k.
Abstract: We show that the k th smallest element in a large heap is at expected depth ≤log k. Simulation results indicate that this bound is tight, and that the variance of the depth is no more than 0.8, independent of k.
2 citations