A stable quicksort
- 1 June 1981
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 11 (6) , 607-611
- https://doi.org/10.1002/spe.4380110604
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Stable Sorting and Merging with Optimal Space and Time BoundsSIAM Journal on Computing, 1977
- The analysis of Quicksort programsActa Informatica, 1977
- Survey on Algorithms 347, 426, and QuicksortACM Transactions on Mathematical Software, 1976
- A fast stable sorting algorithm with absolutely minimum storageTheoretical Computer Science, 1975
- A stable minimum storage sorting algorithmInformation Processing Letters, 1974
- Some performance tests of “quicksort” and descendantsCommunications of the ACM, 1974
- 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