… skewed order statistics of a sample instead of the tertiles. The … potential to tune dual-pivot
Quicksort using skewed pivots [31], … way to sample pivots by means of a precise analysis of the …

… two tertiles in a sample of size 5 as pivots (ie, the elements of rank 2 and 4). In Section 7, we
analyze the comparison count of dual-pivot quicksort algorithms with this sampling strategy. …

… analysis of multiway Quicksort including the important optimization to choose pivots from a
sample of … with pivot sampling and multiway partitioning as for the random-permutation case. …

… The most notable contribution to the study of pivot sampling is the computation of higher
order moments, which is also contained in [Hen89]. The exact expressions are quite lengthy and …

… comparisons than classic single-pivot Quicksort implementations. In this paper, we extend
the analysis to the case where the two pivots are chosen as fixed order statistics of a random …

… than classic singlepivot Quicksort. In this paper, we extend the analysis to the case where
the two pivots are chosen as fixed order statistics of a random sample. Surprisingly, …

… cache behavior than the dual pivot quicksort in the expected case… analyses of the cache
behaviors of the various quicksort … a very large sample to perform a 4-way/3-pivot partition of the …

… of quicksort and dual-pivot quicksort, pivots are usually taken from a small sample of … (iii)
We analyze sampling strategies for multi-pivot quicksort algorithms with respect to comparisons …

… This article does not consider more refined ways to choose pivots, like selecting order statistics
of a random sample. We decided to defer a detailed treatment of Yaroslavskiy’s algorithm …

… comparisons than classic single-pivot Quicksort implementations. In this paper, we extend
the analysis to the case where the two pivots are chosen as fixed order statistics of a random …