Multi-pivot quicksort: theory and experiments

DOI10.1137/1.9781611973198.6MaRDI QIDQ5232491zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Shrinu Kushagra, Aurick Qiao, J. Ian Munro, Alejandro Lopez-Ortiz

Publication date 12 September 2019

Published in 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973198.6

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• How good is multi-pivot quicksort?
• Optimal partitioning for dual-pivot quicksort
• Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
• Pivot sampling in dual-pivot quicksort: exploiting asymmetries in Yaroslavskiy's partitioning scheme
• Optimal Partitioning for Dual Pivot Quicksort

Cited in

(11)

• An improved quicksort algorithm based on tissue-like P systems with promoters
• Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
• Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures
• DUAL PIVOT QUICKSORT
• BlockQuicksort: avoiding branch mispredictions in Quicksort
• How good is multi-pivot quicksort?
• In-place parallel super scalar samplesort (\(\mathrm{IPS}^4\mathrm{o}\))
• Sesquickselect: one and a half pivots for cache-efficient selection
• Optimal Partitioning for Dual Pivot Quicksort
• Discrete Fréchet distance for closed curves
• Adaptive Order-of-Addition Experiments via the Quick-Sort Algorithm

This page was built for publication: Multi-pivot quicksort: theory and experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232491)