/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 vote311 views1 answer
Python ieee 754 converter
Python
0 vote335 views1 answer
Python find multiple matches in string
Python
11 votes372 views2 answers
Check if file is txt python
Python
4 votes351 views1 answer
Python code to drop columns from dataframe
Python
0 vote341 views1 answer
Parallel loops in python
Python
1 vote330 views1 answer
Query with condition django
Python
1 vote368 views1 answer
Django integer field example
Python Django
4 votes318 views1 answer
.text python
Python
0 vote314 views1 answer
Test register user mismatched passwords
Python
0 vote359 views1 answer
Iloc[:,0:-1]
Python