Optimal Partitioning for Dual Pivot Quicksort

DOI10.1007/978-3-642-39206-1_4zbMath1336.68051OpenAlexW2571500349MaRDI QIDQ5326548

Martin Dietzfelbinger, Martin Aumüller

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_4

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ BlockQuicksort ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm

This page was built for publication: Optimal Partitioning for Dual Pivot Quicksort