Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths
-
Published:2018-08-14
Issue:4
Volume:28
Page:485-518
-
ISSN:0963-5483
-
Container-title:Combinatorics, Probability and Computing
-
language:en
-
Short-container-title:Combinator. Probab. Comp.
Author:
AUMÜLLER MARTIN,DIETZFELBINGER MARTIN,HEUBERGER CLEMENS,KRENN DANIEL,PRODINGER HELMUT
Abstract
We present an average-case analysis of a variant of dual-pivot quicksort. We show that the algorithmic partitioning strategy used is optimal, that is, 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 proved.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference25 articles.
1. Aumüller M. , Dietzfelbinger M. , Heuberger C. , Krenn D. and Prodinger H. (2016) Counting zeros in random walks on the integers and analysis of optimal dual-pivot quicksort. In Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms.
2. Hennequin P. (1991) Analyse en moyenne d'algorithmes : Tri rapide et arbres de recherche. PhD thesis, École Polytechnique, Palaiseau.
3. OEIS (2017) The On-Line Encyclopedia of Integer Sequences. oeis.org
4. Analysis of pivot sampling in dual-pivot quicksort: A holistic analysis of Yaroslavskiy's partitioning scheme.;Nebel;Algorithmica,2016
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献