Computer Algorithms

This course is where you stop just writing code that works and start asking whether it works *well*, measuring algorithms by how their running time and memory grow as inputs scale, and learning the standard design templates (divide-and-conquer, dynamic programming, greedy, graph traversals) that most real problems eventually reduce to. Expect a steady diet of pen-and-paper analysis (recurrences, Big-O proofs) alongside coding exercises where you implement and compare approaches, graded through two quizzes, a midterm, and a final. It builds directly on your data structures background and becomes the toolkit you'll lean on in every later CTIS course that involves performance, optimization, or non-trivial problem solving.