A Note on HEAPSORT

DOI10.1093/COMJNL/35.4.410MaRDI QIDQ4019942zbMATH OpenOpenAlexFDO

Authors

Publication date 16 January 1993

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/35.4.410

zbMATH Keywords

comparisonsHEAPSORT

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A variant of heapsort with almost optimal number of comparisons
• Sorting using heap structure
• An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons
• Optimal heapsort algorithm
• scientific article; zbMATH DE number 1444318

Cited in

(14)

• A variant of heapsort with almost optimal number of comparisons
• Weak-heap sort
• The heap-mergesort
• Sorting using heap structure
• A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly
• Explaining binomial heaps
• scientific article; zbMATH DE number 1555945 (Why is no real title available?)
• scientific article; zbMATH DE number 1444318 (Why is no real title available?)
• Optimal heapsort algorithm
• An optimal algorithm for deleting the root of a heap
• An algorithm for merging heaps
• Worst-case analysis of a generalized heapsort algorithm
• Multiway in-place merging
• On sorting, heaps, and minimum spanning trees

This page was built for publication: A Note on HEAPSORT

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