A note on upper bounds for the selection problem

DOI10.1016/0020-0190(82)90120-XzbMath0498.68031MaRDI QIDQ1171384

Tatsuya Motoki

Publication date: 1982

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

zbMATH Keywords

worst-case analysisminimum comparison selectionoptimum sorting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items

Progress in selection ⋮ Finding the \(\alpha n\)-th largest element ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the median
• Time bounds for selection
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Bounds for Selection
• New upper bounds for selection