/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

55 votes165 views6 answers
Train test split
Python
2 votes148 views1 answer
Python bin()
Python
0 vote151 views1 answer
Python print main arguments
Python
22 votes142 views5 answers
Select rows with nan pandas
Python
8 votes154 views2 answers
Python foreach 2d array
Python
0 vote198 views1 answer
Python string: .split()
Python
16 votes150 views5 answers
Set window size tkinter
Python
3 votes186 views1 answer
Django import model from another app
Python Django
0 vote141 views1 answer
Python while variable is not
Python
0 vote148 views1 answer
Toy dataframe df simple
Python