Unformatted text preview: multiple selection problem is that of ±nding the k ith smallest element in the set S for every i = 1, 2, . . . , m . A person solved this problem by applying m times the Selection algorithm that was discussed in class, one for each integer k i . This resulted in an O ( mn ) time algorithm. You are asked to design an O ( n log m ) time algorithm for this problem. ( 20 points ) 3. Problem 5.16, page 115. ( 20 points ) 4. Problem 5.19, page 115. ( 20 points ) Total Points : 80...
View
Full Document
 Spring '11
 游啟璋
 Selection algorithm, time algorithm, th smallest element, multiple selection problem

Click to edit the document details