Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm
Sebastian Wild, Markus E. Nebel, Hosam Mahmoud

TL;DR
This paper analyzes the performance of Quickselect with Yaroslavskiy's dual-pivot partitioning, revealing it is less efficient than older methods for finding order statistics, with exact averages and distributional results derived.
Contribution
It provides the first detailed analysis of Quickselect under Yaroslavskiy's dual-pivot algorithm, including exact averages and distributional characterizations of comparisons.
Findings
Quickselect under Yaroslavskiy's algorithm performs worse than older methods for random rank statistics.
Exact grand averages of comparisons are derived for various order statistics.
Limiting distributions are characterized as perpetuities involving independent mixed random variables.
Abstract
There is excitement within the algorithms community about a new partitioning method introduced by Yaroslavskiy. This algorithm renders Quicksort slightly faster than the case when it runs under classic partitioning methods. We show that this improved performance in Quicksort is not sustained in Quickselect; a variant of Quicksort for finding order statistics. We investigate the number of comparisons made by Quickselect to find a key with a randomly selected rank under Yaroslavskiy's algorithm. This grand averaging is a smoothing operator over all individual distributions for specific fixed order statistics. We give the exact grand average. The grand distribution of the number of comparison (when suitably scaled) is given as the fixed-point solution of a distributional equation of a contraction in the Zolotarev metric space. Our investigation shows that Quickselect under older…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
