Median selection requires (2+∈)N Comparisons

Dorit Dor*, Uri Zwick

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

26 Scopus citations


Improving a long standing result of Bent and John [Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, RI, 1985, pp. 213-216], and extending a recent result of Dor, Håstad, Ulfberg, and Zwick [SIAM J. Discrete Math., 14 (2001), pp. 299-311], 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.

Original languageEnglish
Pages (from-to)312-325
Number of pages14
JournalSIAM Journal on Discrete Mathematics
Issue number3
StatePublished - May 2001


  • Comparison algorithms
  • Lower bounds
  • Median selection


Dive into the research topics of 'Median selection requires (2+∈)N Comparisons'. Together they form a unique fingerprint.

Cite this