Proceedings of 37th Conference on Foundations of Computer Science (1996)

Burlington, VT

Oct. 14, 1996 to Oct. 16, 1996

ISBN: 0-8186-7594-2

pp: 125

ABSTRACT

Improving a long standing result of Bent and John, we obtain a (2+e)n lower bound (for some fixed .e > 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 weightfunction that allows us to combine leaf counting and adversary arguments. I

INDEX TERMS

CITATION

D. Dor and U. Zwick, "Median Selection Requires Comparisons,"

*Proceedings of 37th Conference on Foundations of Computer Science(FOCS)*, Burlington, VT, 1996, pp. 125.

doi:10.1109/SFCS.1996.548471

CITATIONS