Median Selection Requires Comparisons

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