TY - JOUR
T1 - Median selection requires (2+∈)N Comparisons
AU - Dor, Dorit
AU - Zwick, Uri
PY - 2001/5
Y1 - 2001/5
N2 - 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.
AB - 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.
KW - Comparison algorithms
KW - Lower bounds
KW - Median selection
UR - http://www.scopus.com/inward/record.url?scp=0037537067&partnerID=8YFLogxK
U2 - 10.1137/S0895480199353895
DO - 10.1137/S0895480199353895
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0037537067
SN - 0895-4801
VL - 14
SP - 312
EP - 325
JO - SIAM Journal on Discrete Mathematics
JF - SIAM Journal on Discrete Mathematics
IS - 3
ER -