Time complexity in above Picture
Fibonacci Number using Recursion
CODE:def fib(n):
Share and Support
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)
@Python_Codes
>>Click here to continue<<
