/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

26 votes205 views5 answers
Python class name
Python
0 vote114 views2 answers
Python using dll
Python
0 vote112 views1 answer
Return a new RDD containing only the elements that satisfy a predicate.
Python
1 vote109 views1 answer
Python anagram finder
Python
2 votes116 views1 answer
Python gui capture user input
Python
0 vote112 views1 answer
How to make a loading gif in pyqt5
Python
0 vote122 views1 answer
How to create enter pressed for qlineedit in pyqt5
Python
0 vote116 views1 answer
Place legend on location matplotlib
Python
1 vote125 views1 answer
Pros and cons of python flush print function
Python
21 votes117 views6 answers
Set to List
Python