On the average-case complexity of selecting k-th best

Let Vk (n) be the minimum average number of pairwise comparisons needed to find the k-th largest of n numbers (k≥2), assuming that all n! orderings are equally likely. D. W. Matula proved that, for some absolute constant c, Vk(n)- n ≤ ck log log n as n → ∞. In the present paper, we show that there exists an absolute constant c′ ≫ 0 such that Vk(n) - n ≥ c′k log log n as n → ∞, proving a conjecture by Matula.

[1]  Robert L. Scot Drysdale,et al.  Generalized Voronoi diagrams and geometric searching , 1979 .

[2]  Andrew Chi-Chih Yao,et al.  Information Bounds Are Weak in the Shortest Distance Problem , 1980, JACM.

[3]  Oscar H. IBARm.  Information and Control , 1957, Nature.

[4]  Ronald L. Rivest,et al.  Expected time bounds for selection , 1975, Commun. ACM.

[5]  Andrew Chi-Chih Yao,et al.  On the Polyhedral Decision Problem , 1980, SIAM J. Comput..

[6]  Micha Hofri,et al.  A Stochastic Model of Bin-Packing , 1980, Inf. Control..

[7]  David Galer Kirkpatrick,et al.  Topics in the complexity of combinatorial algorithms. , 1974 .

[8]  Vaughan R. Pratt,et al.  On Lower Bounds for Computing the i-th Largest Element , 1973, SWAT.

[9]  Harold N. Gabow,et al.  A Counting Approach to Lower Bounds for Selection Problems , 1979, JACM.

[10]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..

[11]  Andrew Chi-Chih Yao,et al.  A Note on the Analysis of Extendible Hashing , 1980, Inf. Process. Lett..

[12]  Harold N. Gabow,et al.  Using computer trees to derive lower bounds for selection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[13]  Andrew Chi-Chih Yao,et al.  Some Monotonicity Properties of Partial Orders , 1979, SIAM J. Algebraic Discret. Methods.

[14]  Laurent Hyafil.  Bounds for Selection , 1976, SIAM J. Comput..

[15]  Bruce W. Weide,et al.  Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

[16]  Donald E. Knuth,et al.  Mathematical Analysis of Algorithms , 1971, IFIP Congress.

[17]  Andrew Chi-Chih Yao,et al.  Should Tables Be Sorted? , 1981, JACM.