Optimal Partitioning for Dual-Pivot Quicksort

DOI10.1145/2743020zbMath1398.68114arXiv1303.5217OpenAlexW1890752145MaRDI QIDQ4962214

Martin Aumüller, Martin Dietzfelbinger

Publication date: 30 October 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.5217

zbMATH Keywords

sortingquicksortdual-pivot

Mathematics Subject Classification ID

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

Related Items (2)

Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths ⋮ Complexity analysis and performance of double hashing sort algorithm

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