/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 vote149 views1 answer
Python open file exception
Python
0 vote154 views1 answer
Script python to download videio from any website
Python
0 vote151 views1 answer
Pandas and operator
Python
0 vote163 views1 answer
Loop append to list python
Python
10 votes160 views5 answers
Appending to a list python
Python
0 vote189 views1 answer
111
Python
1 vote182 views2 answers
Django password hashing
Python
0 vote188 views1 answer
Selenium python class contains
Python
9 votes153 views1 answer
Print current dirfile dir python
Python
0 vote218 views1 answer
How to select the shortest item in a python list
Python