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
Get step-by-step solutions from verified subject matter experts
