Sorting using heap structure

References

• Aho , A.V. , Hopcroft , J.E. and Ullman , J.D. 1974 . The Design and Analysis of Computer Algorithms , Reading, MA : Addison-Wesley .
   Google Scholar
• Carlsson , S. 1987 . A variant of HEAPSORT with almost optimal number of comparisons . Information Processing Letters , 24 ( 4 ) March : 247 – 250 .
   Web of Science ®Google Scholar
• Carlsson , S. 1987 . Average-case results on heapsort . BIT , 27 March : 2 – 17 .
   Web of Science ®Google Scholar
• Carlsson , S. , Chen , J. and Mattsson , C. 1996 . Heaps with bits . Theoretical Computer Science , 164 March : 1 – 12 .
   Google Scholar
• Floyd , R.W. 1964 . Algorithm 245 . CACM , 7 ( 12 ) December : 701 Treesort
   Web of Science ®Google Scholar
• Gonnet , G.H. and Munro , J.I. 1986 . Heaps on heaps . SIAM J. Computing , 15 : 964 – 971 .
   Web of Science ®Google Scholar
• Horowitz , E. and Sahni , S. 1995 . Fundamentals of Computer Algorithms , New Delhi : Galgotia Publications Pvt. Ltd. .
   Google Scholar
• Katajainen , J. , Pasanen , T. and Teuhola , J. 1996 . Practical in-place mergesort . Nordic Journal of Computing , 3 : 27 – 40 .
   Google Scholar
• Knuth , D.E. 1973 . “ The Art of Computer Programming ” . In Sorting and Searching , Vol. III , Reading, MA : Addison-Wesley .
   Google Scholar
• McDiarmid , C.J.H. and Reed , B. 1989 . Building heaps fast . Journal of Algorithms , 10 : 352 – 365 .
   Google Scholar
• Mehlhorn , K. 1984 . Data Structures and Algorithms 1: Sorting and Searching , Heidelberg : Springer Verlag .
   Google Scholar
• Mehlhorn , K. and Tsakalidis , A. 1990 . “ Data Structures ” . In Handbook of Theoretical Computer Science , Edited by: Van Leeuwen , J. 301 – 241 . The Netharlands : Elsevier . Chapter 6
   Google Scholar
• Noltemeier , H. 1990 . Dynamic partial orders and generalized heaps . Computing (Suppl.) , 7 : 125 – 139 .
   Google Scholar
• Wegener , I. 1993 . BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small) . Theoretical Computer Science , 118 : 81 – 98 .
   Google Scholar
• Wegener , I. 1992 . The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than nlogn+ 1.1n . Information and Computation , 97 : 86 – 96 .
   Web of Science ®Google Scholar
• Williams , J.W.J. 1964 . Algorithm 232 . CACM , 7 ( 6 ) June : 347 – 348 .
   Google Scholar