The analysis of Quicksort programs
- 1 January 1977
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 7 (4), 327-355
- https://doi.org/10.1007/bf00289467
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Quicksort with Equal KeysSIAM Journal on Computing, 1977
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- Some performance tests of “quicksort” and descendantsCommunications of the ACM, 1974
- Sorting in a paging environmentCommunications of the ACM, 1970
- Samplesort: A Sampling Approach to Minimal Storage Tree SortingJournal of the ACM, 1970
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969
- Some Theorems on SortingSIAM Journal on Applied Mathematics, 1969
- Algorithm 271: quickersortCommunications of the ACM, 1965
- QuicksortThe Computer Journal, 1962
- Algorithm 64: QuicksortCommunications of the ACM, 1961