Sorting using heap structure

International Journal of Computer Mathematics

Volumn 77, Issue 3, 2001, Pages 347-354

  Chowdhury, Rezaul Alam ^a   Kaykobad, M ^a  

^a BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

Author keywords

Complexity; Fine heap; Heapsort; MDR HEAPSORT; Mergesort

Indexed keywords

COMPLEXITY; FINE HEAP; HEAPSORT; MDR-HEAPSORT; MERGESORT;

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

ALGORITHMS;

EID: 26444512198     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Aho, A. V., Hopcroft, J. E. and Ullman, J. D., The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
2. Carlsson, S., A variant of HEAPSORT with almost optimal number of comparisons, Information Processing Letters, 24(4), 247-250, March, 1987.
3. Carlsson, S. (1987). Average-case results on heapsort, BIT, 27, 2-17.
4. Carlsson, S., Chen, J. and Mattsson, C. (1996). Heaps with bits, Theoretical Computer Science, 164, 1-12.
5. Floyd, R. W., Algorithm 245, Treesort, CACM, 7(12), 701, December, 1964.
6. Gonnet, G. H. and Munro, J. I. (1986). Heaps on heaps, SIAM J. Computing, 15, 964-971.
7. Horowitz, E. and Sahni, S., Fundamentals of Computer Algorithms, Galgotia Publications Pvt. Ltd., New Delhi, 1995.
8. Katajainen, J., Pasanen, T. and Teuhola, J. (1996). Practical in-place mergesort, Nordic Journal of Computing, 3, 27-40.
9. Knuth, D. E., The Art of Computer Programming, Vol. III: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
10. McDiarmid, C. J. H. and Reed, B. A. (1989). Building heaps fast, Journal of Algorithms, 10, 352-365.
11. Mehlhorn, K., Data Structures and Algorithms 1: Sorting and Searching. Springer Verlag, Heidelberg, 1984.
12. Mehlhorn, K. and Tsakalidis, A., "Data Structures", In: Handbook of Theoretical Computer Science, van Leeuwen, J. Ed., The Netharlands: Elsevier, 1990, Chapter 6, pp. 301-241.
13. Noltemeier, H. (1990). "Dynamic partial orders and generalized heaps", Computing (Suppl.), 7, 125-139.
14. 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.
15. 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.
16. Williams, J. W. J., Algorithm 232, CACM, 7(6), 347-348, June, 1964.