Dynamic Programming using Fibonacci – Approaches

Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13...Formula: f(n) = f(n-1) + f(n-2) 1. 🚀 Recursion (Brute Force) int rec(int n) { if (n == 0 || n == 1) return n; return rec(n - 1) + rec(n - 2); } int fib(int n) { return rec(n); } Steps: Base...