Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 88, 2011 - Issue 16
Submit an article Journal homepage
83
Views
0
CrossRef citations to date
0
Altmetric
Section A

An in-place heapsort algorithm requiring nlogn+nlog*n−0.546871n comparisons

Md. Mahbubul Hasan CSE Department, Bangladesh University of Engineering and Technology, Dhaka, BangladeshCorrespondence[email protected]
,
Md. Shahjalal Therap (BD) Ltd, Banani, Dhaka, 1213, Bangladesh
&
M. Kaykobad CSE Department, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
Pages 3350-3360 | Received 08 Sep 2010, Accepted 22 Jun 2011, Published online: 22 Aug 2011

References

  • Carlsson , S. 1987 . A variant of heapsort with almost optimal number of comparisons . Inform. Process. Lett. , 24 : 247 – 250 .
  • Carlsson , S. 1991 . An optimal algorithm for deleting the root of a heap . Inform. Process. Lett. , 37 : 117 – 120 .
  • Carlsson , S. and Chen , J. 1995 . Heap Construction: Optimal in Both Worst and Average Cases? , 254 – 263 . Berlin Heidelberg : Springer . ISAAC, Lecture Notes in Computer Science, Vol. 1004
  • Dutton , R. D. 1993 . Weak-heap sort . BIT , 33 : 372 – 381 .
  • Edelkamp , S. and Stiegeler , P. 2002 . Implementing heapsort with and quicksort with comparisons . ACM J. Exp. Algorithmics , 7 : 20 – 34 .
  • Gonnet , G. H. and Munro , J. I. 1986 . Heaps on heaps . SIAM J. Comput. , 15 : 964 – 971 .
  • Islam , T. M. and Kaykobad , M. 2006 . Worst-case analysis of generalized heapsort algorithm revisited . Int. J. Comput. Math. , 83 : 59 – 67 .
  • J. Katajainen, The Ultimate Heapsort, CATS, 1998, pp. 87–96
  • Kaykobad , M. , Islam , M. M. , Amyeen , M. E. and Murshed , M. M. 1998 . 3 is a more promising algorithmic parameter than 2 . Comput. Math. Appl. , 36 : 19 – 24 .
  • Mcdiarmid , C. and Reed , B. A. 1989 . Building heaps fast . J. Algorithms , 10 : 352 – 365 .
  • Paulik , A. 1990 . Worst-case analysis of a generalized heapsort algorithm . Inform. Process. Lett. , 36 : 159 – 165 .
  • Nath , S. K. , Chowdhury , R. A. and Kaykobad , M. 2000 . A simplified complexity analysis of Mcdiarmid and Reed's variant of bottom-up heapsort algorithm . Int. J. Comput. Math. , 73 : 293 – 297 .
  • Shahjalal , Md. and Kaykobad , M. 2007 . A New Data Structure for Heapsort with Improved Number of Comparisons , 88 – 96 . Dhaka : WALCOM, Bangladesh Computer Council Bhaban, Agargaon .
  • Wang , X. D. and Wu , Y. J. 2007 . An improved heapsort algorithm with comparisons in the worst case . J. Comput. Sci. Technol. , 22 : 898 – 903 .
  • Wegener , I. 1993 . Bottom-up-heapsort, a new variant of heapsort, beating, on an average, quicksort (if n is not very small) . Theor. Comput. Sci. , 118 : 81 – 98 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.