Linear-time in-place selection in less than 3n comparisons

DOI10.1007/BFB0015429zbMath1512.68074MaRDI QIDQ6487970

Svante Carlsson, Unnamed Author

Publication date: 21 March 2023

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Related Items (3)

Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ Prune-and-search with limited workspace

Cites Work

• Unnamed Item
• Finding the median
• Time bounds for selection

This page was built for publication: Linear-time in-place selection in less than 3n comparisons