/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

2 votes270 views2 answers
How to make a latency command in discord py
Python
0 vote476 views1 answer
Django form custom validation
Python Django
0 vote282 views1 answer
Run python script without .py
Python
0 vote299 views1 answer
Reload is not defined python 3
Python
1 vote301 views1 answer
How to make markdown cell in jupyter notebook
Python
1 vote319 views1 answer
Numpy unique axis
Python
0 vote278 views1 answer
Reset a turtle python
Python
13 votes279 views3 answers
Pandas reset index start from 0
Python
0 vote318 views1 answer
Apyori
Python
3 votes305 views2 answers
Python get current mouse position
Python