Lecture 2
We covered the preliminary administrative
details that one normally does on the first lecture.
See Lecture 1 for more
details.
I then briefly
provided some thoughts on studying data structures and analyzing algorithms, as
motivation for doing this course.
We then looked at several
problems having to do with points. We saw a simple algorithm to find the
"lexicographically smallest point". We then argued about the correctness and
computational complexity of the algorithm.
In closing I described the
maximum contiguous subset sum problem which can also be found in chapter 6 of
the text. With any luck we will look at this problem in detail on Friday.
In case you are reading this
and are still not sure where we meet, I can say with authority that we will meet
in JEF126.
Posted: Wed - January 12, 2005 at 03:04 PM