/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 vote236 views1 answer
Random question generator python
Python
0 vote224 views1 answer
Get false positives from confusoin matrix
Python
0 vote227 views1 answer
Get video width and height cv2
Python
0 vote233 views1 answer
(function(a_,%20b_)%20%7B%20with%20(a_)%20with%20(b_)%20return%20summary%20%7D)
Python
0 vote215 views1 answer
List tuple dictionary,
Python
2 votes222 views4 answers
ModuleNotFoundError: No module named 'tensorflow_io'
Python
4 votes210 views1 answer
ModuleNotFoundError: No module named 'exceptions'
Python
8 votes218 views6 answers
Python get numbers from string
Python
1 vote241 views2 answers
'str' object has no attribute 'strftime'
Python
0 vote214 views1 answer
Valor absoluto en python
Python