Heapsort --- adapted for presorted files

DOI10.1007/3-540-51542-9_41MaRDI QIDQ4028912zbMATH OpenFDO

Authors Ola Petersson, Christos Levcopoulos

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51542-9_41

zbMATH Keywords

geometric interpretationheapmeasuresoptimalitypresortedness

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Adaptive Heapsort
• Measures of Presortedness and Optimal Sorting Algorithms
• scientific article; zbMATH DE number 3943040
• A new measure of presortedness
• Splitsort -- an adaptive sorting algorithm

Cited in

(12)

• Splitsort -- an adaptive sorting algorithm
• Arranging \(n\) distinct numbers on a line or a circle to reach extreme total variations
• Right invariant metrics and measures of presortedness
• Cartesian and Lyndon trees
• Measures of Presortedness and Optimal Sorting Algorithms
• Adaptive Heapsort
• Sorting shuffled monotone sequences
• A framework for adaptive sorting
• Smooth heaps and a dual view of self-adjusting data structures
• A note on adaptive parallel sorting
• Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.
• A note on construction of treaps and Cartesian trees

This page was built for publication: Heapsort --- adapted for presorted files

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