These notes are not intended to be a substitute for taking notes in class. <

Date	Contents
1/20/2006	Constructive Induction, Recurrence Relations
1/23/2006	Master Theorem
1/27/2006	Program Verification, Graph Definitions
1/30/2006	Heap Definition
2/3/2006	Heaps
2/6/2006	Quicksort
2/8/2006	Analysis of Quicksort
2/10/2006	Counting & Radix Sorts
2/13/2006	Bucket Sort & Randomized Selection
2/15/2006	Selection in Worst-Case Linear Time
2/17/2006	C++ code for selection (buggy)
2/20/2006	Factory Scheduling
2/22/2006	Factory Scheduling (cont)
2/24/2006	Matrix Chain Multiplication
2/27/2006	Matrix Chain Multiplication Example, Longest Common Subsequence
3/3/2006	Longest Common Subsequence
3/15/2006	Activity Selection
3/20/2006	Graph Representation/BFS
3/22/2006	Depth First Search
3/24/2006	Topological Sort
3/29/2006	Strongly Connected Components
3/31/2006	Kruskal's Algorithm for Minimum Spanning Trees
4/5/2006	Disjoint Set Forests
4/7/2006	Prim's MST Algorithm
4/10/2006	Single Source Shortest Paths
4/12/2006	All Pairs Shortest Paths
4/19/2006	Johnson's Algorithm
4/24/2006	NP, NP-complete problems
4/28/2006	Reductions to show problems are NP-complete
5/1/2006	More Reductions