Home/ Questions/Q 6603227
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-25T18:58:51+00:00

I am trying to find complexity of Fibonacci series using a recursion tree and

  • 0

I am trying to find complexity of Fibonacci series using a recursion tree and concluded height of tree = O(n) worst case, cost of each level = cn, hence complexity = n*n=n^2

How come it is O(2^n)?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    The complexity of a naive recursive fibonacci is indeed 2ⁿ.

    T(n) = T(n-1) + T(n-2) = T(n-2) + T(n-3) + T(n-3) + T(n-4) = 
= T(n-3) + T(n-4) + T(n-4) + T(n-5) + T(n-4) + T(n-5) + T(n-5) + T(n-6) = ...

    In each step you call T twice, thus will provide eventual asymptotic barrier of:
    T(n) = 2⋅2⋅...⋅2 = 2ⁿ

    bonus: The best theoretical implementation to fibonacci is actually a close formula, using the golden ratio: 

    Fib(n) = (φⁿ – (–φ)⁻ⁿ)/sqrt(5) [where φ is the golden ratio]

    (However, it suffers from precision errors in real life due to floating point arithmetics, which are not exact)

    • 0