Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths
Preprint
Abstract
We present an average case analysis of a variant of dual-pivot quicksort. We show that the used algorithmic partitioning strategy is optimal, i.e., it minimizes the expected number of key comparisons. For the analysis, we calculate the expected number of comparisons exactly as well as asymptotically, in particular, we provide exact expressions for the linear, logarithmic, and constant terms. An essential step is the analysis of zeros of lattice paths in a certain probability model. Along the way a combinatorial identity is proven.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- How Good Is Multi-Pivot Quicksort?ACM Transactions on Algorithms, 2016
- Optimal Partitioning for Dual-Pivot QuicksortACM Transactions on Algorithms, 2015
- Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy’s Partitioning SchemeAlgorithmica, 2015
- Average Case and Distributional Analysis of Dual-Pivot QuicksortACM Transactions on Algorithms, 2015
- Analytic Combinatorics2009
- Concrete Mathematics: A Foundation for Computer Science.The American Mathematical Monthly, 1991