/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 vote140 views1 answer
Who is agada nathan
Python
66 votes136 views6 answers
How to open csv file in python
Python
6 votes137 views3 answers
Get particular columns from dataframe
Python
3 votes132 views6 answers
Concatenate List
Python
57 votes139 views4 answers
Get date and time in python
Python
5 votes169 views2 answers
Django form password field
Python Django
0 vote124 views2 answers
Python create gif
Python
0 vote135 views1 answer
Python webdriver disable logs
Python
0 vote133 views1 answer
Conversion un type image en array python
Python
0 vote123 views1 answer
Conv2 python
Python