Chapter 9 Exercises and Problems

Exercises
9.3-6 The k-th quantiles of an n-element set are the k-1 order statistics that divide the sorted set into k equal-sized sets (to within 1). Give an O(nlogk)-time algorithm to list the k-th quantiles of a set.
Use divide-and-conquer strategy and O(n) selection algorithm, we can conclude the complexity is T(n,k) = 2*T(n/2,k/2) + O(n)
Note that each level in the recursion tree is O(n), and there are O(logk) levels(since k<=n)
Thus T(n,k) = O(nlogk)

Problems
9-2 Weighted median
For n distinct elemennts x1~xn with positive weights w1~wn such that sigma(i=1~n,wi)=1, the weighted(lower) median is the element xk satisfying:
sigma(xi sigma(xi>xk,wi) <= 1/2
c. Show how to compute the weighted median in Θ(n) worst-case time using a linear-time median algorithm such as SELECT from Section 9.3
SELECT the median-of-median, partition the array, and then sum up the lower part partitioned to decide which branch to enter.
The recurrence is identical to that of SELECT's. Thus the worst-case time is also Θ(n).

转载于:https://www.cnblogs.com/FancyMouse/articles/1055088.html