/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

2 votes136 views1 answer
How to change the color of the cursor in tkinter
Python
81 votes163 views6 answers
Python convert string to date
Python
15 votes135 views5 answers
Tkinter tutorial
Python
1 vote141 views1 answer
Convert tibble to dataframe
Python
0 vote156 views1 answer
TypeError at /admin/auth/user/
Python
0 vote148 views1 answer
Close all tables python
Python
5 votes153 views3 answers
Pandas convert string to float
Python
0 vote139 views1 answer
Get admin url of instance django
Python
8 votes160 views2 answers
Show image jupyter notebook
Python
2 votes139 views2 answers
Python include another python file
Python