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?
- Overview of Algorithm Analysis
- Describing algorithms
- Algorithm Performance
- Proof of correctness
- Recurance Rleations
- Methods for Solving Recurence Relations.
- Sorting
- Review of $O(n^2)$ sorts.
- Review of $O(n \cdot log_2 n)$ sorts.
- Limits of comparison based sorts.
- Linear time Sorting
- Counting Sort
- Radix Sort
- Bin Sort
- Medians and Order Statistics
- Greedy Algorithms
- Graph Algorithms
- Graph Representation
- Searching
- Topological Sorting
- Minimal Spanning Trees
- Single-Source Shortest Path
- Dijkstra's
- Bellman-Ford
- Single-source shortest path in DAG
- All-Pairs Shortest Path
- Maximum Flow
- Distributed Algorithms.
- Complexity Theory
- The classes P and NP
- Approximation Algorithms
- Limits of Computation
- Approximation Algorithms