Course Topics

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