Course Topics

1. Introduction.
   1. Introduction to analysis of algorithms.
   2. Examples: Insertion sort and merge sort.
   3. Asymptotic (Theta, etc.) notation.
   4. Correctness of algorithms.
2. Solving Recurrences.
3. Divide-and-conquer. Examples: Strassen's algorithm, Quicksort, binary search, exponentiation (of bignums).
4. More Sorting.
5. Dynamic Programming
6. Greedy Algorithms.
7. Graph Algorithms.
8. NP-completeness.
9. String matching.
10. Other advanced topics as time permits.