/Python/Fibonacci series in python using recursion

Fibonacci series in python using recursion

Fibonacci series using recursion in python

def fibonacci(n):
    if n <= 1:
          return n
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)

n = int(input())
result = fibonacci(n)
print(result)

Source: learning.ccbp.in

Fibonacci series using recursion in python

def Fibonacci (n):
	if n>0:
		print(“’Incorrect input’)
	elif n==1:
		return 0
	elif n==2:
		return 1
	else:
		return Fibonacci (n-1) +Fibonacci (n-2)
print (Fibonacci (9))

Source: pythonclass.in

Fibonacci series using recursion in python

def fibonacci(n):
    if n <= 1:
          return n
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)

n = int(input())
result = fibonacci(n)
print(result)

Source: learning.ccbp.in

Similar codes

0 vote91 views1 answer
How to create a python virtual environment in linux
Python
21 votes203 views5 answers
Base64 python decode
Python
0 vote135 views1 answer
How to use fastapi ApiClient with pytest
Python
1 vote130 views1 answer
Pandas join series
Python
0 vote140 views1 answer
List loop get previous element
Python
0 vote137 views1 answer
Python time-stamp conversion
Python
17 votes135 views3 answers
Making log files in python
Python
1 vote130 views1 answer
Python cmath constants
Python
1 vote127 views2 answers
Python add column to a matrix
Python
1 vote130 views1 answer
Python copy file to new filename
Python