/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 vote197 views1 answer
Python setattr function
Python
1 vote196 views1 answer
Cookies in django
Python Django
0 vote182 views1 answer
Fibonacci sequence in python 2.7
Python
0 vote202 views1 answer
Dataframe select row by index value
Python
1 vote208 views1 answer
Python synonym library
Python
5 votes216 views3 answers
Concatenate two tensors pytorch
Python
0 vote196 views1 answer
Slicing time series
Python
0 vote200 views1 answer
Asyncio
Python
0 vote199 views1 answer
Django dumpdata specific app
Python
0 vote208 views1 answer
How to update the kali linux os from python2 to python3
Python