Abstract
We present an average case analysis of two variants of dual-pivot quicksort, one with a non-algorithmic
comparison-optimal partitioning strategy, the other with a closely related algorithmic strategy. For both
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.
comparison-optimal partitioning strategy, the other with a closely related algorithmic strategy. For both
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.
Originalsprog | Engelsk |
---|---|
Titel | Proceedings of the 27th Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms |
Antal sider | 13 |
Forlag | Jagiellonian University in Krakow |
Publikationsdato | 4 jul. 2016 |
Status | Udgivet - 4 jul. 2016 |
Begivenhed | International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms - Jagiellonian University, Kraków, Polen Varighed: 4 jul. 2016 → 7 jul. 2016 Konferencens nummer: 27 http://www.aofa2016.meetings.pl/ |
Konference
Konference | International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms |
---|---|
Nummer | 27 |
Lokation | Jagiellonian University |
Land/Område | Polen |
By | Kraków |
Periode | 04/07/2016 → 07/07/2016 |
Internetadresse |
Emneord
- Dual-pivot quicksort
- Average case analysis
- Comparison-optimal partitioning
- Algorithmic strategy
- Lattice paths analysis