A method of comparing the time requirements of sorting methods

Authors:
Michael H. Hall
Affiliations:
Mitre Corp., Bedford, MA
Venue:
Communications of the ACM
Year:
1963

Citing 5
Cited 4

Sorting on Electronic Computer Systems

Journal of the ACM (JACM)
Analysis of Internal Computer Sorting

Journal of the ACM (JACM)
A Sorting Problem

Journal of the ACM (JACM)
A high-speed sorting procedure

Communications of the ACM
A high-speed sorting procedure

Communications of the ACM

Sorting

ACM Computing Surveys (CSUR)
Universal programming languages and processors: a brief survey and new concepts

AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
Some improvements in the technology of string merging and internal sorting

AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
A guided bibliography to sorting

IBM Systems Journal

Quantified Score

Hi-index	48.22

Visualization

Abstract

Formulas have been developed for estimating the sorting time required by most of the known internal sorting methods in terms of parameters describing the file to be sorted and the computer time required for basic sorting operations. Procedures are described for using these estimates to compare the efficiency of various methods, and results of several comparisons are given. A procedure to determine optimum combinations of sorting methods is shown. An expression for tape time required by a balanced merge sort is obtained, and difficulties in obtaining such expressions for cascade, polyphase and oscillating sorts are discussed.