/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

0 vote268 views1 answer
String maniupulation in python
Python
0 vote283 views1 answer
How to comment a para in python
Python
4 votes262 views2 answers
How to get runtime of a function in python
Python
5 votes270 views2 answers
Python train test val split
Python
0 vote260 views1 answer
Python find closest date
Python
0 vote272 views1 answer
Python pandas rellenar con ceros a la izquierda
Python
3 votes293 views1 answer
Open cv read webcam
Python
0 vote261 views3 answers
Pandas check if column type is list
Python
1 vote274 views1 answer
Python recursive sum of digit
Python
0 vote256 views1 answer
Python pandas table save
Python