/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

10 votes157 views3 answers
Text to image python
Python
-2 votes165 views3 answers
Python list of all characters
Python
0 vote183 views1 answer
How to import flask restful using pip
Python Flask
1 vote192 views1 answer
How to send json in django response
Python Django
0 vote186 views1 answer
How to make loops in python
Python
0 vote172 views1 answer
Pandas column filter
Python
-2 votes150 views4 answers
Merge pandas datasets
Python
0 vote179 views1 answer
Django create username and password from csv
Python
1 vote154 views1 answer
Convert tibble to dataframe
Python
0 vote150 views1 answer
Php echo shorthand example
Python