Analysis of Hoare's FIND algorithm with Median-of-three partition

DOI<143::AID-RSA7>3.0.CO;2-V 10.1002/(SICI)1098-2418(199701/03)10:1/2<143::AID-RSA7>3.0.CO;2-VzbMath0867.68034OpenAlexW2017427035MaRDI QIDQ3122910

Peter Kirschenhofer, Conrado Martínez, Prodinger, Helmut

Publication date: 5 March 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<143::aid-rsa7>3.0.co;2-v

zbMATH Keywords

Hoare's FIND algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (10)

On Smoothed Analysis of Quicksort and Hoare’s Find ⋮ Almost sure convergence to the quicksort process ⋮ On smoothed analysis of quicksort and Hoare's find ⋮ The analysis of range quickselect and related problems ⋮ BlockQuicksort ⋮ Multiple Quickselect -- Hoare's Find algorithm for several elements ⋮ Using nonlinear difference equations to study Quicksort algorithms ⋮ Limit laws for the Randić index of random binary tree models ⋮ Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization ⋮ On Floyd and Rivest's SELECT algorithm

This page was built for publication: Analysis of Hoare's FIND algorithm with Median-of-three partition