/Python/Fibonacci series using recursion

Fibonacci series using recursion

def fib (n):
  if n == 0 or n ==1:
      return n  
  else:
        return fib(n-2) + fib(n-1)
#n = int(input("please enter a number  "))

n=10
for index,num in enumerate(range(n+1)):
     print(f"F{index} :", fib(num))

Source: onecompiler.com

Similar codes

1 vote173 views2 answers
Sns figsize
Python
0 vote224 views1 answer
How to deploy to heroku djangorest framework app
Python Django
0 vote164 views1 answer
Get subscriber count with python
Python
1 vote179 views1 answer
Python number divisible by two other numbers
Python
0 vote155 views1 answer
Add field placeholder layout crispy modelform
Python
0 vote180 views1 answer
How can space be bent
Python
0 vote181 views1 answer
Get data from s3 bucket python
Python
1 vote164 views1 answer
Python cv2.Canny()
Python
2 votes172 views1 answer
Input float python
Python
9 votes171 views2 answers
Import numpy python
Python