/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

-3 votes211 views1 answer
Django socketio web chat example
Python Django
0 vote190 views2 answers
Convert pdf folder to excell pandas
Python
0 vote176 views1 answer
Statsmodels logistic regression odds ratio
Python
38 votes224 views6 answers
Remove substring from string python
Python
0 vote181 views1 answer
Pandas boolean array calculating the average of a column based on another column filter
Python
0 vote188 views1 answer
Count wit for loop pthoon
Python
34 votes164 views6 answers
How to update a python package
Python
1 vote193 views1 answer
Tkinter remove frame
Python
1 vote174 views1 answer
Failed to execute script
Python
9 votes167 views6 answers
Activate virtual environment python windows 10
Python