Sorting
William A. Martin · ACM Computing Surveys · 1971
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.
Cited by 49 works. doi:10.1145/356593.356594 Open-access PDF
Authors
References
- A Tournament Problem
- Scatter storage techniques
- Sorting on Electronic Computer Systems
- Trie memory
- Use of tree structures for processing files
- Algorithm 245: Treesort
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
- Optimum binary search trees
- Trees, Forests and Rearranging
- Quicksort