An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons

DOI10.1080/00207160.2011.600449zbMath1242.68086OpenAlexW1989389618MaRDI QIDQ2885554

No author found.

Publication date: 23 May 2012

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2011.600449

zbMATH Keywords

data structureheapsort algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)

Cites Work

• Unnamed Item
• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• An optimal algorithm for deleting the root of a heap
• Worst-case analysis of a generalized heapsort algorithm
• A variant of heapsort with almost optimal number of comparisons
• 3 is more promising algorithmic parameter than 2
• Weak-heap sort
• Worst-case analysis of generalized heapsort algorithm revisited
• Heaps on Heaps
• Building heaps fast
• A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort

This page was built for publication: An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons