Question: Suppose you are given a function which computes the median of n numbers in O(n) time. How can you use this function (your algorithm will
Suppose you are given a function which computes the median of n numbers
in O(n) time. How can you use this function (your algorithm will make function calls to
this one), to find the kth smallest number in a given array A[1..n] of positive integers.
Your algorithm should run in O(n) time and work for arbitrary k (Hint: Use reduce-andconquer).
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
