/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

-2 votes390 views2 answers
Where to import reverse_lazy in django
Python Django
17 votes318 views4 answers
Python if else
Python
0 vote317 views1 answer
How to solve add decimals in strings as integers
Python
0 vote339 views1 answer
Tkinter hide widget
Python
0 vote347 views1 answer
Give colour to the font in python email message
Python
0 vote328 views1 answer
If statement collection python
Python
0 vote336 views2 answers
Python bytes to dict
Python
1 vote319 views1 answer
Import antigravity in python
Python
0 vote334 views1 answer
Entropy formula pyhon
Python
0 vote312 views1 answer
How to add percentage in countplot
Python