Give an efficient algorithm that finds the ith largest numbers in a set of n numbers. Do not assume that the input is sorted. The output numbers do not have to be in order. What is the running time of your algorithm?
Testimonials
algorithm
Give an efficient algorithm that finds the ith largest numbers in a set of n numbers. Do not assume that the input is sorted. The output numbers do not have to be in order. What is the running time of your algorithm?