Please note: All course content has transitioned to Canvas.

This course covers fundamental techniques for algorithm design and analysis, including computational complexity, greedy algorithms, divide-and-conquer algorithms, dynamic programming, graph algorithms, randomized algorithms, and computational intractability.