Recursion and DP 0, 1, 1, 2, 3, 5, 8, ? Fibonacci Numbers https://repl.it/@1001000x4/recursion Runtime of roughly O(2^n) We should look for a way to optimize this. Each time we compute fib (i), we should just cache this result and use it later. This is exactly what DP is. https://repl.it/@1001000x4/dp Greatest Common Divisor, GCD https://repl.it/@1001000x4/gcd Time to “Divide and Conquer" Mathematical Thinking: Permutation and Combination $$1x+2y+3x=N$$ 求 (x,y,z) 的非負整數解 Computational Thinking: Recursion and DP https://repl.it/@1001000x4/ClimbingStairs
