/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

35 votes197 views5 answers
How to use replace in python
Python
0 vote201 views1 answer
Extract year from astype('datetime64[ns]')
Python
0 vote191 views1 answer
Read file from s3 python
Python
4 votes190 views1 answer
Check if an application is running python
Python
1 vote195 views1 answer
Python npr permutation calculation
Python
1 vote209 views1 answer
Is there find_all method in re or regex module in python?
Python
0 vote178 views1 answer
Start of the american labor movement
Python
0 vote234 views1 answer
Dataframe move row up one
Python
8 votes189 views2 answers
Python requests header
Python
6 votes223 views3 answers
Pandas to csv without header
Python