Comparisons in Hoare's Find Algorithm

DOI10.1017/S0963548397003325MaRDI QIDQ4383741zbMATH OpenWikidataFDO

Authors Peter Kirschenhofer, Helmut Prodinger

Publication date 2 April 1998

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

Hoare's Find algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1226332
• Analysis of Hoare's FIND algorithm with Median-of-three partition
• scientific article; zbMATH DE number 91009
• On the median-of-k version of Hoare's selection algorithm

Cited in

(13)

• Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
• On smoothed analysis of quicksort and Hoare's find
• Distributional analysis of swaps in quick select
• Perpetuities in fair leader election algorithms
• Binary search tree recursions with harmonic toll functions
• On a reciprocity law for finite multiple zeta values
• Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization
• On Smoothed Analysis of Quicksort and Hoare’s Find
• Mixed Poisson approximation of node depth distributions in random binary search trees
• The m-version of binary search trees: an average case analysis
• The analysis of range quickselect and related problems
• Limit laws for the Randić index of random binary tree models
• On quickselect, partial sorting and multiple Quickselect

This page was built for publication: Comparisons in Hoare's Find Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383741)