/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

31 votes192 views6 answers
Regex to validate email
Python
5 votes117 views1 answer
Translate english to japanese
Python
3 votes156 views4 answers
Delete row by index pandas
Python
0 vote109 views1 answer
Intall python3 in linux
Python
5 votes119 views2 answers
How to get first element of array in python
Python
6 votes120 views1 answer
Python print return code of requests
Python
0 vote124 views1 answer
Python download complete web page
Python
0 vote140 views1 answer
Get all subsets of a list python
Python
0 vote109 views1 answer
Python code pycharm
Python
1 vote126 views4 answers
Flask activ environment
Python