Average Case Analysis of Java 7’s Dual Pivot Quicksort

DOI10.1007/978-3-642-33090-2_71zbMath1337.68083arXiv1310.7409OpenAlexW3105073936MaRDI QIDQ2912899

Markus E. Nebel, Sebastian Wild

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (4)

Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ BlockQuicksort ⋮ Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm

This page was built for publication: Average Case Analysis of Java 7’s Dual Pivot Quicksort