Abstract
The drawbacks of large, general tape sorting programs are pointed out, and a sorting subroutine is suggested as a remedy. The fundamental idea is the separation of the logic in tape sorting from the actual manipulation of external tape units by introduction of the concept of an elementary sorting loop. Examples show how common problems in sorting can be solved using the sorting loop concept. A few considerations in the design and implementation of a sorting subroutine are mentioned, and finally a measure of the efficiency of tape sorting methods is proposed.
Similar content being viewed by others
References
Gotlieb, C. C.,Sorting on Computers, Comm. ACM, vol. 6, No. 5, 1963, p. 194–201.
Gilstad, R. L.,Polyphase Merge Sorting—An Advanced Technique, Proc. Eastern Joint Comput. Conf., Dec. 1960, p. 143–148.
Sobel, S.,Oscillating Sort—A New Merge Sorting Technique, Journal ACM, vol. 9, 1962, p. 372–374.
Burge, W. H.,Sorting, Trees, and Measures of Order, Information and Control, vol. 1, 1958, p. 181–197.
Goetz, M. A.,Internal and Tape Sorting Using the Replacement Selection Technique, Comm. ACM, vol. 6, No. 5, 1963, p. 201–206.
Hansen, H. B.,Nogle Principper for Konstruktion of Fleksible Programmer, NordSAM 66, Aug. 1966, Standardsystemer, bilag B8.
Control Data 1604/1604-A Computer, SORT/Reference Manual.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hansen, H.B., Wessel, A. Subroutinized tape sorting. BIT 7, 96–102 (1967). https://doi.org/10.1007/BF01934272
Issue Date:
DOI: https://doi.org/10.1007/BF01934272