1.) find x= median in o(n) 2.) subtract x from each number of the array 3.) find the k smallest number using o(n) algrithm
On Jan 21, 4:04 am, snehal jain <learner....@gmail.com> wrote: > Given an unsorted array A of n distinct numbers and an integer k where > 1 <= k <= n, design an algorithm that finds the k numbers in A that > are closest in value to the median of A in O(n) time. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
