/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

66 votes140 views6 answers
How to open csv file in python
Python
0 vote166 views1 answer
Django serializer get image list
Python Django
0 vote93 views1 answer
Hebrew range
Python
0 vote144 views1 answer
Python Remove Character from String using replace()
Python
0 vote147 views1 answer
How to add base map in pyqgis
Python
0 vote139 views1 answer
Returns a DataFrame representing the result of the given query
Python
1 vote158 views1 answer
Like in mysqldb python
Python
-1 vote147 views1 answer
Print multiplication table python
Python
0 vote174 views1 answer
How to use str()
Python
0 vote156 views1 answer
No module named 'bootstrap4' django
Python