/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 vote287 views1 answer
Python code to demonstrate inheritance with animal class
Python
32 votes283 views6 answers
Merge pandas
Python
1 vote268 views1 answer
Assert len(lex) < self.bucket_specs[-1][1]
Python
1 vote298 views1 answer
How to delete print statement from console pythonn
Python
0 vote287 views1 answer
Trends in yearly data python
Python
2 votes273 views1 answer
Find all color in image python
Python
1 vote286 views1 answer
ANSHUL
Python
-1 vote304 views1 answer
John cabot
Python
73 votes270 views6 answers
Reverse the string in python
Python
0 vote272 views1 answer
Set a Widget size to the parent size from python in kivy
Python