Performance Engineering Case Study: Heap Construction

@inproceedings{Bojesen1999PerformanceEC,
  title={Performance Engineering Case Study: Heap Construction},
  author={Jesper Bojesen and Jyrki Katajainen and Maz Spork},
  booktitle={Algorithm Engineering},
  year={1999}
}
The behaviour of three methods for constructing a binary heap is studied. The methods considered are the original one proposed by Williams 1964], in which elements are repeatedly inserted into a single heap; the improvement by Floyd 1964], in which small heaps are repeatedly merged to bigger heaps; and a recent method proposed, e. g., by Fadel et al. 1999] in which a heap is built layerwise. Both the worst-case number of instructions and that of cache misses are analysed. It is well-known that… CONTINUE READING
Highly Cited
This paper has 44 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Heaps and heapsort

R. Fadel, K. V. Jakobsen, J. Katajainen, J. Teuhola
1999
View 10 Excerpts
Highly Influenced

The C++ programming language (3. ed.)

View 28 Excerpts
Highly Influenced

Algorithm 245: Treesort

Commun. ACM • 1964
View 5 Excerpts
Highly Influenced

Sorting and searching on the word RAM

STACS • 1998
View 3 Excerpts
Highly Influenced

Building Heaps Fast

J. Algorithms • 1989
View 2 Excerpts
Highly Influenced