/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

0 vote130 views1 answer
Re python split()
Python
4 votes100 views1 answer
Python open and read file with
Python
0 vote111 views1 answer
How to get the author on discord.py
Python
8 votes104 views6 answers
Pandas groupby
Python
1 vote106 views1 answer
How to get last values or data in django orm
Python
0 vote152 views1 answer
Print map object python
Python
0 vote108 views1 answer
Tkinter file dialog multiple file types
Python
9 votes108 views6 answers
Python dictionary
Python
3 votes111 views2 answers
Python get line of exception
Python
1 vote106 views1 answer
Sort a list numbers in python
Python