| CSc 445 | ( Spring 2006 ) : Slides |
| Date | Download File | |
| 1/19 | Introduction. Big-O, Omega, Theta, and recursion formula | |
| 1/14 | Sorting in linear time | |
| 1/23 | A Bound on Sorting | |
| Jan 25 | QuickSort in O(n log n) time | |
| Feb | Graphs and MST | |
| Feb | Shortest Paths (positive weights) | |
| Feb | Shortest Paths (negative weights) | |
| Feb | Shortest Paths - Johnson algorithm | |
| Feb 22 | Dynamic-Programming | |
| March | Network Flow | |
| April 4 | Tries and Suffix Trees | |
| April 10 | Computational Geometry | |
| April 21 | Stable Marriage | |
| April 24 | Approximation Algorithms | |
| April 26 | Skip Lists | |
| April 26 | Data structures for Union/Find Opertaions | |
March 30,2005