/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

8 votes293 views2 answers
How to print all combinations of a string in python
Python
2 votes326 views2 answers
Python search first occurrence in string
Python
0 vote299 views1 answer
Python press key to break
Python
5 votes300 views2 answers
Run JupyterLab
Python
0 vote284 views1 answer
Gpu version of pytorch
Python
0 vote310 views1 answer
Convert numpy array to tfrecord and back
Python
0 vote298 views2 answers
Read excel spark
Python
0 vote310 views1 answer
How to show a frequency distribution based on date in python
Python
108 votes215 views17 answers
Conda environment setup
Python
74 votes299 views9 answers
Online python compiler
Python