/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 vote197 views4 answers
Python print string
Python
35 votes253 views6 answers
Lambda python
Python
1 vote225 views1 answer
Set time complexity python
Python
8 votes212 views3 answers
Fatal error in launcher: Unable to create process using '"'
Python
9 votes190 views6 answers
How to use print in python
Python
91 votes199 views6 answers
How to create a virtual environment in python
Python
0 vote225 views1 answer
Mechanize python XE #25
Python
1 vote229 views1 answer
Ipython save session
Python
8 votes191 views1 answer
Pygame draw rect syntax
Python
-1 vote183 views1 answer
Email validation using django
Python