/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 vote144 views1 answer
Selenium get back from iframe python
Python
0 vote132 views1 answer
With open python print file name
Python
0 vote138 views1 answer
Credential not provided when i try to sign up a new user django
Python
1 vote175 views1 answer
Python volver al principio
Python
71 votes156 views6 answers
Shuffle array python
Python
1 vote142 views1 answer
Python enum
Python
79 votes143 views6 answers
Read csv python
Python
14 votes185 views1 answer
Python directory contains file
Python
1 vote141 views3 answers
Flatmap python
Python
1 vote152 views2 answers
Operators in python
Python