This preview shows page 1. Sign up to view the full content.
Unformatted text preview: not yet removed from consideration, where each interval but the largest is either the upper half or lower half of the next larger block.] 3. Let P be a set of n points in the plane. The staircase of P is the set of all points in the plane that have at least one point in P both above and to the right. Prove that computing the staircase requires at least ( n log n ) comparisons in two ways, (a) Reduction from sorting. (b) Directly. 1...
View Full
Document
 Fall '08
 Chekuri,C
 Algorithms, Sort

Click to edit the document details