/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

9 votes197 views6 answers
How to use print in python
Python
0 vote215 views1 answer
Longest Palindromic Substring using DP
Python
1 vote194 views2 answers
Factors addition in pyhone
Python
0 vote214 views1 answer
Recieve output from java python
Python
0 vote220 views1 answer
Df.fillna("tagline",inplace=True) in jupyter notebook
Python
0 vote203 views1 answer
SimpleITK interpolation
Python
0 vote156 views1 answer
Snipe cmd python.py
Python
0 vote191 views1 answer
Python greater than dunder
Python
1 vote226 views1 answer
Lecture de fichier python
Python
2 votes208 views1 answer
Python can't subtract offset-naive and offset-aware datetimes
Python