/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 vote388 views1 answer
Create jwt token in django
Python Django
2 votes378 views1 answer
How store list in django session
Python Django
0 vote424 views1 answer
Make the program title a name python
Python
1 vote359 views1 answer
Alarm when code finishes
Python
1 vote380 views1 answer
Pandas select all columns except one
Python
-1 vote351 views1 answer
Python matrix determinant without numpy
Python
0 vote352 views1 answer
Python dns pip
Python
0 vote356 views1 answer
Mute button tkinter
Python
1 vote353 views1 answer
Rerun file after change python
Python
1 vote360 views1 answer
Django ckeditor not working
Python