/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 votes105 views5 answers
Get object attributes python
Python
11 votes102 views4 answers
Python execute shell command and get output
Python
1 vote111 views1 answer
Python new line character in string
Python
0 vote106 views1 answer
Break input loop
Python
0 vote113 views1 answer
Installing python 3 to linux
Python
0 vote130 views1 answer
Check if key exists in sesson python flask
Python
1 vote165 views6 answers
Python filter function
Python
1 vote136 views1 answer
Django login redirect
Python Django
0 vote61 views1 answer
Range of y & x in scatter
Python
0 vote63 views1 answer
Python histogram one liners
Python