Optimal sampling strategies in quicksort
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 327-338
- https://doi.org/10.1007/bfb0055064
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An improved master theorem for divide-and-conquer recurrencesPublished by Springer Nature ,1997
- Optimal sampling strategies for quicksortRandom Structures & Algorithms, 1995
- Expected time bounds for selectionCommunications of the ACM, 1975
- 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
- QuicksortThe Computer Journal, 1962
- Algorithm 64: QuicksortCommunications of the ACM, 1961