This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: log n ). Grading Upto 6 points: Using binary search algorithm as the argument for proving the lower bound. The solutions that talk about binary search fail to point out that the log n lower bound comes from having O ( n ) distinct elements. Using such binary search argument it is possible to show that search in an array with all elements having same value (for which we can come up with a O (1) algorithm, assuming we know that information before hand) has a lower bound of log n . Using some form of reduction, in the right direction. From 8 to 14 points: Using height of the decision tree for lower bound, but a mistake in the argument. From 16 to 20 points: Mostly precise proof about height of the decision tree. 2...
View
Full
Document
This note was uploaded on 01/15/2012 for the course COT 5405 taught by Professor Ungor during the Fall '08 term at University of Florida.
 Fall '08
 UNGOR
 Algorithms

Click to edit the document details