/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 vote224 views1 answer
Magic line not found jupyter notebook
Python
0 vote207 views1 answer
Pyhton constructor name
Python
2 votes216 views1 answer
Convert opencv image to pil image
Python
0 vote237 views1 answer
Change date format on django templates
Python Django
2 votes210 views1 answer
Django and react url conflict
Python
2 votes224 views3 answers
How to get an input into a list python
Python
0 vote220 views1 answer
Pandas convert string to numpy array
Python
1 vote269 views2 answers
Operators in python
Python
0 vote239 views1 answer
Delete all historical data django simple history
Python
0 vote207 views1 answer
Plt multiple figures to show
Python