331H Algorithms and Complexity: Honors

This course includes:  algorithmic paradigms: divide and conquer, dynamic programming, greedy algorithms.  Graph algorithms. Randomized algorithms. Undecidability.  NP-completeness.  Approximation algorithms. Sorting lower bound. Selected topics from amortized analysis, network flow, linear programming.

Program: 
Undergraduate Program
Division: 
Core - Theory