Multiple Quickselect -- Hoare's Find algorithm for several elements

DOI10.1016/0020-0190(95)00150-BMaRDI QIDQ672250zbMATH OpenFDO

Authors Helmut Prodinger

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsOrder statisticsSelection

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
• Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
• On the median-of-k version of Hoare's selection algorithm
• Analysis of multiple quickselect variants.
• Analysis of Hoare's FIND algorithm with Median-of-three partition

Cites work

• scientific article; zbMATH DE number 3755865 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3405492 (Why is no real title available?)
• Analysis of Hoare's FIND algorithm with Median-of-three partition
• Analysis of quickselect : an algorithm for order statistics
• Approximation Theorems of Mathematical Statistics
• Average-case analysis of multiple Quickselect: An algorithm for finding order statistics

Cited in

(15)

• Distributional convergence for the number of symbol comparisons used by QuickSelect
• Limit laws for the Randić index of random binary tree models
• Analysis of multiple quickselect variants.
• On quickselect, partial sorting and multiple Quickselect
• Mixed distributions in Sattolo's algorithm for cyclic permutations via randomization and derandomization
• Quickselect tree process convergence, with an application to distributional convergence for the number of symbol comparisons used by worst-case find
• scientific article; zbMATH DE number 1984552 (Why is no real title available?)
• Binary search tree recursions with harmonic toll functions
• Analysis of swaps in radix selection
• Near-optimal online multiselection in internal and external memory
• Streaming Algorithms for Selection and Approximate Sorting
• Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
• Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
• The analysis of range quickselect and related problems
• Distributional analysis of swaps in quick select

Describes a project that uses

Uses Software

• Find

This page was built for publication: Multiple Quickselect -- Hoare's Find algorithm for several elements

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