Top: ClassS04CS141/Week1

Read Chapter 1. (Sections 1.3.4 and 1.5 may be new, don't worry if they are not clear).
Familiarize yourself with the contents of Chapters 2, 3, and 4. Much of this should be review from cs14.
/Prog1 - programming project 1 part 1. (Do part 2 week 2.) due date for full project is April 12, 2004 at 5pm.

[slides from 3/29/04] - worst-case analysis of algorithms
/Notes 04 02 - union-find data structure, O(N+M log(M)) bound (M = #elements)
/Notes 03 31 - geometric sums, growable arrays, O(N+M) bound (M = max index referenced)