Optimal sampling strategies for quicksort

DOI10.1002/rsa.3240070403zbMath0835.68028OpenAlexW2094467557MaRDI QIDQ4858238

C. C. McGeoch, J. D. Tygar

Publication date: 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240070403

zbMATH Keywords

Quicksort algorithmgeneral sampling strategies

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

Unnamed Item ⋮ Finding a mediocre player ⋮ Presorting algorithms: an average-case point of view

Cites Work

• Finding the median
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

This page was built for publication: Optimal sampling strategies for quicksort