Median selection requires (2+ε)n comparisons

Dorit Dor*, Uri Zwick

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

Improving a long standing result of Bent and John, we obtain a (2+ε)n lower bound (for some fixed ε>0) on the number of comparisons required, in the worst case, for selecting the median of n elements. The new lower bound is obtained using a weight function that allows us to combine leaf counting and adversary arguments.

Original languageEnglish
Pages (from-to)125-134
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - 1996
EventProceedings of the 1996 37th Annual Symposium on Foundations of Computer Science - Burlington, VT, USA
Duration: 14 Oct 199616 Oct 1996

Cite this