EC201: Algorithms & Problem Decomposition

Designing Procedures the Way Great Thinkers Do

Big-O is cognitive load, recursion is self-reflection, algorithms are thinking rituals

Highlights

• Big-O as time/space + brain cost
• Recursion vs iteration, memoization, DP
• Search/sort families and when to use them
• Greedy vs exhaustive vs heuristic approaches
• Human-centered problem breakdowns

Structure

1. Mental Models of Complexity – Estimating cost before coding
2. Classic Patterns – Search, sort, divide & conquer
3. Recursive Thinking – Self-similarity in systems and people
4. Dynamic Programming – Remembering to go faster
5. Algorithm Design Sessions – Practice from scratch

Outcomes

• Architect algorithms from fuzzy prompts
• Explain tradeoffs with intuition and rigor
• Map coding interview patterns to real systems

Connections

• Builds on EC103
• Essential for EC202, EC301, EC402

Difficulty: ⭐⭐⭐☆☆ | Time: 15 hours | Prereq: EC103