20 citations · 97 across the 21 of their papers we have counts for
4 papers · 1 filter
QuickXsort - A Fast Sorting Scheme in Theory and Practice
Stefan Edelkamp, Armin Weiß, Sebastian Wild
QuickXsort is a highly efficient in-place sequential sorting scheme that mixes Hoare's Quicksort algorithm with X, where X can be chosen from a wider range of other known sorting a…
Sesquickselect: One and a half pivots for cache-efficient selection
Conrado Martínez, Markus Nebel, Sebastian Wild
Because of unmatched improvements in CPU performance, memory transfers have become a bottleneck of program execution. As discovered in recent years, this also affects sorting in in…
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs
J. Ian Munro, Sebastian Wild
We present two stable mergesort variants, "peeksort" and "powersort", that exploit existing runs and find nearly-optimal merging orders with practically negligible overhead. Previo…
Average Cost of QuickXsort with Pivot Sampling
Sebastian Wild
QuickXsort is a strategy to combine Quicksort with another sorting method X, so that the result has essentially the same comparison cost as X in isolation, but sorts in place even…