Algorithms I

This is the graduate-level core algorithms course, where the real focus is learning to *reason* about algorithms — proving correctness, bounding runtime with recurrences and amortized analysis, and recognizing when divide-and-conquer, dynamic programming, or a greedy choice is the right hammer. The work is four problem-set-style homeworks built around Cormen (CLRS), so expect tight proofs and complexity arguments rather than coding sprints. It's the foundation MS students lean on for almost everything downstream — complexity theory, approximation, ML theory, systems research — and it's where you stop treating Big-O as trivia and start using it as a design tool.