Elementary yet precise worst-case analysis of Floyd's heap-construction program

DOI10.3233/FI-2012-751MaRDI QIDQ3168521zbMATH OpenOpenAlexFDO

Authors Marek A. Suchenek

Publication date 31 October 2012

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2012-751

zbMATH Keywords

heapsortsum of digitsworst-case analysis

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
• Heap construction: Optimal in both worst and average cases?
• A lower bound for the worst case of bottom-up-heapsort
• Building heaps fast
• scientific article; zbMATH DE number 742986

Cited in

(8)

• Optimizing binary heaps
• Worst-case analysis of generalized heapsort algorithm revisited
• scientific article; zbMATH DE number 1543353 (Why is no real title available?)
• The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items
• A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
• scientific article; zbMATH DE number 742986 (Why is no real title available?)
• Algorithms and Data Structures
• Performance engineering case study

This page was built for publication: Elementary yet precise worst-case analysis of Floyd's heap-construction program

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