Ononot — What is the time complexity of the recursive Fibonacci calcu

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

Recursionhard

0:00.0

What is the time complexity of the recursive Fibonacci calculation $F(n) = F(n-1) + F(n-2)$ without memoization?