This preview shows page 1. Sign up to view the full content.
Unformatted text preview: problem is in fact the conquer step of the divide-and-conquer algorithm for the skyline problem in the textbook.) You may consider using the plane sweeping technique discussed in class. ( 20 points ) 3. Exercise 5.11, page 115. ( 20 points ) 4. Read Chap. 6.4.1 and do Exercise 6.27, page 178. ( 20 points ) Hint : You may consider the following idea. Suppose the maximum string length is k . You may let your algorithm consist of k sorting stages . At the i-th stage (which performs sorting based on the i-th digits of the strings), only those strings whose lengths are at least i actually participate in the sorting of this stage. What will be the sequence of sorting stages that you use? How would you make this idea work (if you like to play with this idea)? Total Points : 80...
View Full Document
- Spring '11