GATEBOOK_DSA5_7

Question

Which of the following provides a lower bound on the number of comparisons needed 
to find the kth largest element in an array of n integer elements?

(A) n ∗ k
(B) n + k − log n
(C) min (n + k − 1, 2(n − k + 1))
(D) n − 1 + min (k − 1, n − k)

 

Comments

how u find kth largest in tournament method?

---

Sorry my fault...I mis interpreted the question.

---

otherwise

we also can do $\log n!+k$ comparisons

https://gateoverflow.in/505/gate1991-01-vii