/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

3 votes309 views3 answers
Python post request
Python
0 vote237 views2 answers
Python fraction simplify
Python
0 vote296 views1 answer
ImportError: cannot import name 'Request' from 'urllib2' (unknown location)
Python
0 vote291 views1 answer
Set path for another directory
Python
0 vote306 views1 answer
Add download directory selenium python
Python
1 vote256 views1 answer
Python remove read only file
Python
0 vote315 views1 answer
Codeforces 677a solution
Python
25 votes294 views3 answers
Ndarray to list
Python
12 votes325 views4 answers
Unzip in python
Python
0 vote311 views1 answer
What is onetomany and manytoone
Python