Time complexity in above PictureFibonacci Number using RecursionCODE:def fib(n): if n <= 0: # base case 1 return 0 if n <= 1: # base case 2 return 1 else: # recursive step return fib(n-1) + fib(n-2)Share and Support @Python_Codes

Time complexity in above Picture

Fibonacci Number using Recursion

CODE:

def fib(n):
  if n <= 0: # base case 1
    return 0
  if n <= 1: # base case 2
    return 1
  else: # recursive step
    return fib(n-1) + fib(n-2)

Share and Support
@Python_Codes

www.tg-me.com/pl/Python Codes/com.python_codes/203

6.6K viewsedited May 24, 2022 at 04:40

tg-me.com/python_codes/203

Create: 2022-05-24
Last Update: 2025-07-02 15:42:59

Time complexity in above Picture

Fibonacci Number using Recursion

CODE:

def fib(n): if n <= 0: # base case 1 return 0 if n <= 1: # base case 2 return 1 else: # recursive step return fib(n-1) + fib(n-2)Share and Support
@Python_Codes

BY Python Codes

Share with your friend now:
tg-me.com/python_codes/203

Python Codes Telegram | DID YOU KNOW?

A project of our size needs at least a few hundred million dollars per year to keep going,” Mr. Durov wrote in his public channel on Telegram late last year. “While doing that, we will remain independent and stay true to our values, redefining how a tech company should operate.