CP312
Algorithm Design and Analysis I
Fall 2026
Topics
- Algorithm complexity
- recurrences
- brute-force methods
- depth-first and breadth-first search
- decrease-and-conquer and divide-and-conquer
- greedy algorithms
- dynamic programming.
Readings
- Introduction to the Design and Analysis of Algorithms — Anany Levitin; 3rd edition, 2012; Pearson.
Sources
- Course catalogue ↗2026–2027
- Public syllabus copy ↗Fall 2026
- Text listed as the course textbook; publicly readable syllabus preview.