Worst-case analysis of generalized heapsort algorithm revisited

DOI10.1080/00207160500113272MaRDI QIDQ3375525zbMATH OpenOpenAlexFDO

Authors

Publication date 14 March 2006

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

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

zbMATH Keywords

\(d\)-heap\(d\)-heapsortheap

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• Worst-case analysis of a generalized heapsort algorithm
• On the Best Case of Heapsort
• A lower bound for the worst case of bottom-up-heapsort
• Elementary yet precise worst-case analysis of Floyd's heap-construction program
• A variant of heapsort with almost optimal number of comparisons

Cites work

• Average-case results on heapsort
• Worst-case analysis of a generalized heapsort algorithm
• Worst-case analysis of generalized heapsort algorithm revisited

Cited in

(6)

• Best case lower bounds for heapsort
• An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons
• Worst-case analysis of generalized heapsort algorithm revisited
• scientific article; zbMATH DE number 176500 (Why is no real title available?)
• A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly
• Worst-case analysis of a generalized heapsort algorithm

This page was built for publication: Worst-case analysis of generalized heapsort algorithm revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3375525)