/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

8 votes201 views2 answers
Django create empty migration
Python
1 vote232 views1 answer
Implement stack using list in python
Python
30 votes205 views4 answers
Python get current hour
Python
0 vote213 views1 answer
Pandas read_csv multiple separator
Python
0 vote230 views1 answer
Django querset group by sum
Python Django
0 vote210 views1 answer
Get return value of contract call in brownie
Python
0 vote241 views1 answer
Python chatbot speech recognition
Python
4 votes223 views4 answers
How to change django admin text
Python Django
5 votes209 views1 answer
How to make a python app for android
Python
0 vote257 views1 answer
How to extract field values in list from queryset in django
Python