Question: Describe an O(n)-time algorithm that, given a set S of n distinct numbers and a positive integer k n, determines the k numbers in
Describe an O(n)-time algorithm that, given a set S of n distinct numbers and a positive integer k – n, determines the k numbers in S that are closest to the median of S.
Step by Step Solution
3.51 Rating (151 Votes )
There are 3 Steps involved in it
ssume fr simliity tht n is dd nd k is even If the set S ws in srted rder the medin is in sitin n2 ... View full answer
Get step-by-step solutions from verified subject matter experts
