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
 Fall '08
 UNGOR
 Algorithms, Big O notation, lower bound

Click to edit the document details