/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

1 vote163 views1 answer
Kaaba python tutorial
Python
19 votes178 views1 answer
Get requests from python
Python
0 vote169 views1 answer
Replace word in column pandas lambda
Python
0 vote193 views1 answer
Find prime in python list
Python
9 votes173 views3 answers
How to detect when a key is pressed in pygame
Python
1 vote176 views1 answer
Coderbyte founded by
Python
0 vote161 views1 answer
Django connect to a db on heroku
Python
5 votes167 views1 answer
Last element in list py
Python
-2 votes182 views1 answer
Start django project in windows
Python
0 vote166 views1 answer
Python get_loc not returning number
Python