Fringe analysis for extquick: An in situ distributive external sorting algorithm

DOI10.1016/0890-5401(91)90007-OMaRDI QIDQ2639632zbMATH OpenFDO

Authors Walter Cunto, J. Ian Munro, Patricio V. Poblete, Gaston H. Gonnet

Publication date 1991

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(91)90007-O

zbMATH Keywords

analysisin situ sorting algorithmstime complexity

Mathematics Subject Classification ID

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

Recommendations

• External quicksort
• Sorting a Random Access File in situ
• An efficient external sorting algorithm
• QuickXsort: a fast sorting scheme in theory and practice

Cites work

• Axioms and hulls
• scientific article; zbMATH DE number 4088895 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Improving time and space efficiency in generalized binary search trees
• Increasing the efficiency of quicksort
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• The analysis of a fringe heuristic for binary search trees
• Transforming unbalanced multiway trees into a practical external data structure

Cited in

(3)

• The analysis of heuristics for search trees
• Sorting a Random Access File in situ
• External quicksort

Describes a project that uses

Uses Software

• Quicksort
• Find
• Algorithm 347

This page was built for publication: Fringe analysis for extquick: An in situ distributive external sorting algorithm

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