Fringe analysis for Extquick: Anin situ distributive external sorting algorithm

Authors:
Walter Cunto;Gastón H. Gonnet;J. Ian Munro;Patricio V. Poblete
Affiliations:
Centro Científico IBM, A.P. 64778, Caracas-1060, Venezuela;Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1;Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1;Departamento de Ciencia de la Computación, Universidad de Chile, Blanco Encalada 2120, Santiago, Chile
Venue:
Information and Computation
Year:
1991

Citing 6
Cited 0

Transforming unbalanced multiway trees into a practical external data structure

Acta Informatica
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
Increasing the efficiency of quicksort

Communications of the ACM
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Communications of the ACM
Algorithm 64: Quicksort

Communications of the ACM
Handbook of Algorithms

Handbook of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A newin situ external sorting algorithm, to be calledExtquick, is developed and its time and space performance are analysed. It is shown that Extquick performs more efficiently than similarin situ sorting algorithms based on Quicksort that appear in the literature. Since the computational tree of Quicksort-like sorting algorithms is equivalent to a search tree, techniques that model the time complexity of such a structure are then used for the analysis of Extquick.