How Many Comparisons Does Quicksort Use?
From MaRDI portal
Publication:4857539
DOI10.1006/jagm.1995.1044zbMath0836.68022OpenAlexW2042263392MaRDI QIDQ4857539
Mark J. Schervish, William F. Eddy
Publication date: 11 April 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1995.1044
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)
Related Items (3)
Some properties of a limiting distribution in Quicksort ⋮ Average-case analysis of multiple Quickselect: An algorithm for finding order statistics ⋮ Approximating the limiting Quicksort distribution
This page was built for publication: How Many Comparisons Does Quicksort Use?