The number of bit comparisons used by quicksort: an average-case analysis

DOI10.1214/EJP.V17-1812zbMath1244.68090arXiv1202.2595MaRDI QIDQ428664

Svante Janson, James Allen Fill

Publication date: 22 June 2012

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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

zbMATH Keywords

quicksortaverage-case analysis of algorithmsPoissonization

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Combinatorial probability (60C05)

Related Items (3)

Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ Distributional convergence for the number of symbol comparisons used by QuickSort ⋮ Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect

This page was built for publication: The number of bit comparisons used by quicksort: an average-case analysis