/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 vote144 views3 answers
How to list all the string's characters in python
Python
0 vote159 views1 answer
Python collections to dictionary
Python
0 vote124 views1 answer
Python pprint on file
Python
48 votes135 views4 answers
Console clear python
Python
-1 vote122 views1 answer
Python chunk up list
Python
-1 vote134 views1 answer
How to make a bitcoin miner in pythonn
Python
1 vote128 views1 answer
Python to 32 bit signed float
Python
3 votes133 views2 answers
Godot restart scene
Python
0 vote135 views1 answer
Flask echo server
Python
10 votes155 views3 answers
Django make migrations
Python Django