Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy’s Partitioning Scheme
- 8 August 2015
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 75 (4) , 632-683
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Spanish Ministry for Economy and Competitiveness (MINECO) and the European Union (FEDER funds) (COMMAS ref. TIN2013-46181-C2-1-R)
This publication has 22 references indexed in Scilit:
- An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithmsJournal of Algorithms, 2002
- Improved master theorems for divide-and-conquer recurrencesJournal of the ACM, 2001
- Optimal Sampling Strategies in Quicksort and QuickselectSIAM Journal on Computing, 2001
- The Influence of Caches on the Performance of SortingJournal of Algorithms, 1999
- Engineering a sort functionSoftware: Practice and Experience, 1993
- A survey of adaptive sorting algorithmsACM Computing Surveys, 1992
- Implementing Quicksort programsCommunications of the ACM, 1978
- The analysis of Quicksort programsActa Informatica, 1977
- Increasing the efficiency of quicksortCommunications of the ACM, 1970
- Algorithm 64: QuicksortCommunications of the ACM, 1961