References
- Aho , A. V. , Hopcroft , J. E. and Ullman , J. D. 1974 . The Design and Analysis of Computer Algorithms , Reading, Mass : Addison-Wesley .
- Carlsson , S. and Chen , J. 1992 . The Complexity of Heaps . Third Annual ACM-SIAM Symp. on Discrete Algorithms , : 393 – 402 .
- Cormen , T. H. , Leiserson , C. E. and Rivest , R. L. 1990 . Introduction to Algorithms , New York : McGraw-Hill .
- Floyd , R. W. Algorithm 245~Treesort 3 . Commun. of the ACM , 1 ( 1964 ) 701 – 701 .
- Fussenegger , F. and Gabow , H. 1979 . A Counting Approach to Lower Bounds for Selection Problems . J ACM , 26 ( 1964 ) : 227 – 238 .
- Gonnet , G. H. and Munro , J. I. 1986 . Heaps on Heaps . SI AM J. Comput , 15 ( 1964 ) : 964 – 971 .
- Knuth , D. E. 1973 . “ Sorting and Searching ” . In The Art of Computer Programming , Vol. 3 , Reading, Mass : Addison-Wesley .
- Ngan T. P Comparison Tree Based Lower Bounds for Constructing Heaps MS Thesis , Computer Science Department Wichita State University June 1993
- Reingold , E. M. 1972 . On the Optimality of Some Set Algorithms . J ACM , 19 : 649 – 659 .
- Williams , J. W. J. 1964 . Algorithm 232: Heapsort . Commun. of the ACM , 1 : 347 – 348 .