/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

1 vote183 views1 answer
How to get files list from active directory from where the python script is running
Python
80 votes199 views3 answers
Python remove last part of string
Python
0 vote161 views1 answer
Python string and variable in 1 print
Python
0 vote168 views1 answer
Python crosshair overlay
Python
5 votes178 views5 answers
Formatted string in python
Python
0 vote219 views1 answer
Random Colored Shapes with python turtle
Python
1 vote188 views1 answer
Keras.layers.MaxPool2D
Python
0 vote151 views1 answer
Find common string in two strings python
Python
10 votes203 views2 answers
How to detect an even number in python
Python
0 vote163 views2 answers
Pdf to word
Python