References

1

Jon Bentley, Programming Pearls, Addison-Wesley ISBN 0-201-10331-1

2

Anthony LaMarca and Richard E. Ladner, The influence of caches on the performance of heaps, The ACM Journal of Experimental Algorithms 1 (1996) Article 4. Available from http://www.jea.acm.org/

3

Donald E. Knuth, The Art of Computer Programming, Volume 3, Second edition.

4

M. D. Atkinson, J.-R. Sack, N. Santaro, and T. Strothotte Min-Max Heaps and Generalized Priority Queues, Communications of the ACM Oct. 1986 p. 996

5

L. M. Wegner and J. I. Teuhola, The external heapsort, IEEE Transactions on Software Engineering 15 (1989), 917-925

6

R. Fadel, K. V. Jacobsen, J. Katajainen, J. Teuhola, Heaps and Heapsort on secondary storage.

7

D. Jones, An empirical comparison of priority-queue and event-set implementations. Communications of the ACM, 29:4:300-311, 1986

8

J. W. J. Williams, Algorithm 232, Heapsort, Communications of the ACM 7 (1964), 347-348

9

R. W. Floyd, Algorithm 245, Treesort 3, Communications of the ACM 7 (1964), 701

10

Bjarne Stroustrup, The C++ programming language, Third edition AT&T ISBN 0-201-88954-4