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

DOI10.1016/0890-5401(91)90007-OzbMath0718.68025MaRDI QIDQ2639632

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

Publication date: 1991

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

zbMATH Keywords

analysistime complexityin situ sorting algorithms

Mathematics Subject Classification ID

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

Related Items (1)

The analysis of heuristics for search trees

Uses Software

• Quicksort
• Find
• Algorithm 347

Cites Work

• Unnamed Item
• Unnamed Item
• Improving time and space efficiency in generalized binary search trees
• Axioms and hulls
• Transforming unbalanced multiway trees into a practical external data structure
• The analysis of a fringe heuristic for binary search trees
• Increasing the efficiency of quicksort
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

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