DocumentCode
2642288
Title
Median selection requires (2+ϵ)n comparisons
Author
Dor, Dorit ; Zwick, Uri
Author_Institution
Dept. of Comput. Sci., Tel Aviv Univ., Israel
fYear
1996
fDate
14-16 Oct 1996
Firstpage
125
Lastpage
134
Abstract
Improving a long standing result of Bent and John (1985), 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
Keywords
algorithm theory; computational complexity; adversary arguments; leaf counting; lower bound; median selection; weight function; Binary trees; Chaos; Computer science; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
Conference_Location
Burlington, VT
ISSN
0272-5428
Print_ISBN
0-8186-7594-2
Type
conf
DOI
10.1109/SFCS.1996.548471
Filename
548471
Link To Document