/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 vote344 views3 answers
Append in python
Python
2 votes298 views1 answer
Django register models
Python
7 votes324 views3 answers
Sklearn random forest regressor
Python
0 vote317 views1 answer
Convert 1 to "one" python
Python
10 votes322 views2 answers
Convert hex to decimal python
Python
-1 vote324 views1 answer
Python webscraper stack overflow
Python
1 vote361 views1 answer
Import "django.core.urlresolvers" could not be resolved
Python Django
0 vote338 views4 answers
Python convert dict_keys to list
Python
29 votes306 views2 answers
Insertion sort in python
Python
0 vote319 views1 answer
A int and float. python
Python