Question: You are given an array A of n distinct numbers A = [a1, a2, ... , an] Provide an O(n) algorithm that returns the 3rd,
You are given an array A of n distinct numbers A = [a1, a2, ... , an]
Provide an O(n) algorithm that returns the 3rd, 4th, and 5th smallest numbers in that array.
More generally, provide an O(n) algorithm that returns all the order statistics between i and j, where i < j (3 to 5 in this case)
I know that you can use the randomized quicksort but
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
