----------------------------------------------------------
Syllabus - COMP 494 - Algorithms - Phillip Rogaway -  1999
----------------------------------------------------------

Introduction 
Divide-and-conquer 
Recurrence relations
Closest Pair 
Quicksort
Selection (probabistic and deterministic)
Lower bounds
Dynamic programming
Hashing
Greedy 
Stable marriages
Union/Find
Graph algorithms
Heaps and heapsort
Data compression
String matching
Convex hull
NP-Completeness
Approximation Algorithms