Class Notes
Class notes will be placed here as they are created. These notes are for my use, but are provided for your convenience. In addition, programs created in class will be posted as they are created. My plan is to cover as much of the first 15 chapters of the book as possible. This may change as the semester progresses. The contents of this page will change.
- A quick review?
- Chapter 1
- Overview of Algorithm Analysis
- Review of $O(n^2)$ sorts.
- Review of $O(n \cdot log_2 n)$ sorts.
- Recurrence Relations
- Sorting
- Medians and Order Statistics.
- Greedy Algorithms
- Some Graphs.
- Graph Algorithms
- Minimal Spanning Trees
- Single-Source Shortest Path
- Complexity Theory
- All-Pairs Shortest Path
- Maximum Flow
- Distributed Algorithms.