/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

12 votes189 views4 answers
Python list intersection
Python
2 votes225 views1 answer
Django flush database
Python Django
-1 vote190 views1 answer
Pseudocode examples for beginners
Python
0 vote144 views1 answer
Jinja for items in list
Python
1 vote203 views1 answer
Tkinter boilerplate
Python
1 vote187 views1 answer
Python zip listas diferente tamaño
Python
0 vote188 views1 answer
How to deploy to heroku djangorest framework app
Python
-1 vote231 views1 answer
How to generate random list in python with specific range
Python
0 vote193 views1 answer
How to extract data from telegram using python
Python
50 votes193 views6 answers
Python plot
Python