On the lower bound for minimum comparison selection

DOI10.21136/am.1978.103726zbMath0418.68061OpenAlexW3048248408MaRDI QIDQ3851641

Peter Ružička, Juraj Wiedermann

Publication date: 1978

Full work available at URL: https://eudml.org/doc/15033

zbMATH Keywords

selection problemlower boundworst-case complexityselection algorithmadversary strategyminimum comparison

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cites Work

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

This page was built for publication: On the lower bound for minimum comparison selection