/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

43 votes101 views4 answers
Conda env
Python
1 vote96 views1 answer
Sorting by second element
Python
10 votes105 views3 answers
Get reactions from message discord.py
Python
0 vote54 views1 answer
Multiplication of matrix in python
Python
0 vote102 views1 answer
Python pow
Python
3 votes106 views2 answers
If not python
Python
0 vote93 views1 answer
Python wget anaconda
Python
8 votes96 views2 answers
Python use functions from another file
Python
0 vote95 views1 answer
Convert json file to dict - if comming as list
Python
5 votes161 views2 answers
My django template doesnt want to load the static file
Python Django