An efficient external sorting with minimal space requirement
- 1 December 1982
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 11 (6) , 381-396
- https://doi.org/10.1007/bf00996816
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A stable quicksortSoftware: Practice and Experience, 1981
- Stable Sorting and Merging with Optimal Space and Time BoundsSIAM Journal on Computing, 1977
- Quicksort with Equal KeysSIAM Journal on Computing, 1977
- The analysis of Quicksort programsActa Informatica, 1977
- Survey on Algorithms 347, 426, and QuicksortACM Transactions on Mathematical Software, 1976
- Algorithms 402: Increasing the efficiency of quicksortCommunications of the ACM, 1970
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969
- Algorithm 271: quickersortCommunications of the ACM, 1965
- QuicksortThe Computer Journal, 1962
- Algorithm 64: QuicksortCommunications of the ACM, 1961