Ononot — A recursive function f(n) calls f(n-1) and f(n-2). If we use

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionhard

0:00.0

A recursive function $f(n)$ calls $f(n-1)$ and $f(n-2)$ . If we use dynamic programming (memoization), the time complexity improves from $O(2^n)$ to: