/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

7 votes176 views1 answer
Smtp email template
Python
11 votes145 views1 answer
How to upgrade 3.6 to 3.7 on linux
Python
2 votes147 views1 answer
Binomial coefficient python
Python
53 votes150 views6 answers
Python 2 decimal places format
Python
1 vote135 views1 answer
Minimum from list of tuples
Python
2 votes141 views1 answer
Discord.py check if user has role
Python
10 votes249 views6 answers
Formatting in python
Python
2 votes158 views2 answers
How to use google translate api in python
Python
0 vote153 views1 answer
Viola conda
Python
1 vote303 views1 answer
Code to calculate dice score
Python