Ononot — When computing the Fibonacci sequence F(n) = F(n-1) + F(n-2)

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

Recursionmedium

0:00.0

When computing the Fibonacci sequence $F(n) = F(n-1) + F(n-2)$ with $F(0)=0, F(1)=1$ using naive recursion, how many additions are performed in total?