A method of comparing the time requirements of sorting methods

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.

REFERENCES

• 1: R. C. Bose , R. J. Nelson, A Sorting Problem, Journal of the ACM (JACM), v.9 n.2, p.282-296, April 1962 [doi>10.1145/321119.321126]
• 2: Ivan Flores, Analysis of Internal Computer Sorting, Journal of the ACM (JACM), v.8 n.1, p.41-80, Jan. 1961 [doi>10.1145/321052.321055]
• 3: R. M. Frank , R. B. Lazarus, A high-speed sorting procedure, Communications of the ACM, v.3 n.1, p.20-22, Jan. 1960 [doi>10.1145/366947.366957]
• 4: Edward H. Friend, Sorting on Electronic Computer Systems, Journal of the ACM (JACM), v.3 n.3, p.134-168, July 1956 [doi>10.1145/320831.320833]
• 5: D. L. Shell, A high-speed sorting procedure, Communications of the ACM, v.2 n.7, p.30-32, July 1959 [doi>10.1145/368370.368387]