Lecture 2.
Today we saw a formal treatment of the
use of Big-O notation. Along the way we discussed binary search and saw why it
is a O(log n) algorithm.
We returned
to the "pillar problem" that was introduced on Monday. We saw an algorithm,
using a stack, of O(n) computational
complexity.
On Friday I plan to
examine the stack algorithm more closely. I will also discuss the use of
Big-Ω and
Big-Θ
notation.
Posted: Wed - January 10, 2007 at 11:31 AM