Bottom-Up DP
Domain: Algorithms
🎯 Motivation
Solving from the smallest subproblems first, building up to the full solution. No recursion, no stack overhead.
📋 Concrete Example
Fibonacci bottom-up: compute fib(0), fib(1), fib(2), … fib(n) in order. Each value uses the two before it. No recursion needed.
🔗 Analogy
Building a tower from the ground up. You lay the foundation first, then each floor builds on the one below. You never start from the top and work down.