Ononot — What is the time complexity of the naive recursive algorithm

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

Recursionhard

0:00.0

What is the time complexity of the naive recursive algorithm for the Fibonacci sequence $f(n) = f(n-1)+f(n-2)$ without memoization?