Sorting
- 1 December 1971
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 3 (4), 147-174
- https://doi.org/10.1145/356593.356594
Abstract
The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples. As the algorithms are explained, references to related algorithms and mathematical or experimental analyses are given. Suggestions are then made for choosing the algorithm best suited to a given situation.Keywords
This publication has 83 references indexed in Scilit:
- Optimum merging from mass storageCommunications of the ACM, 1970
- Sorting in a paging environmentCommunications of the ACM, 1970
- The Use of Information in SortingJournal of the ACM, 1970
- A generalized partial pass block sortCommunications of the ACM, 1968
- Sorting with large volume, random access, drum storageCommunications of the ACM, 1963
- A tape file merge pattern generatorCommunications of the ACM, 1963
- A Sorting ProblemJournal of the ACM, 1962
- Computer Time for Address Calculation SortingJournal of the ACM, 1960
- Sorting, trees, and measures of orderInformation and Control, 1958
- Sorting of data on an electronic computerProceedings of the IEE - Part B: Radio and Electronic Engineering, 1956