1. Engineering
  2. Computer Science
  3. assume that you are given an ontime algorithm selecta k...

Question: assume that you are given an ontime algorithm selecta k...

Question details

Assume that you are given an O(n)-time algorithm Select(A, k) that takes as input an array A of n distinct positive integers and an index k where l 〈 k 〈 n and returns the k-th smallest element in A. Using the Select as subroutine to design an O(n) algorithm that, given an array A of n distinct positive integers and an index k e [1,...,n], determines the k numbers in A that are closest to the median element in A. (The median element in A is the n/2 -th smallest element of A.) Why does your algorithm run in linear time?

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution