算法导论习题[Exercises 9.3-7 ]

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.

solution:

1: procedure k_Closest(S, k) //S: a set of n numbers and k: an integer
2: Output = nothing;
3: m = Select(S, n,n/2) //O(n)
4: for all sin Sand s != m //O(n)
5: s.distance = |m − s|
6: end for
7: md = Select(S.distance, k) //O(n)
8: for all sin S
9: if s.distance<= md.distance then //O(n)
10: Output = Output+ s
11: end if
12: end for
13: return Output
14: end procedure

可见可以在线形时间能得到集合S的K个最邻近点