On quickselect, partial sorting and multiple Quickselect

DOI10.1016/j.ipl.2006.04.003zbMath1185.68284OpenAlexW1990467142MaRDI QIDQ845716

Markus Kuba

Publication date: 29 January 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.003

zbMATH Keywords

algorithmsselectionanalysis of algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (2)

The analysis of range quickselect and related problems ⋮ Moves and displacements of particular elements in quicksort

Uses Software

• Quicksort
• Find

Cites Work

• Multiple Quickselect -- Hoare's Find algorithm for several elements
• Linear probing and graphs
• Binary search tree recursions with harmonic toll functions
• Quickselect and the Dickman Function
• Comparisons in Hoare's Find Algorithm
• A generating functions approach for the analysis of grand averages for multiple QUICKSELECT
• Quicksort
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On quickselect, partial sorting and multiple Quickselect