/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

16 votes166 views4 answers
How to create a tkinter window
Python
29 votes144 views3 answers
Print python float precision
Python
1 vote134 views2 answers
How to add sum of range in python
Python
0 vote138 views1 answer
How to fix snap "pycharm-community" has "install-snap" change in progress
Python
4 votes133 views1 answer
Try with multiple except python
Python
1 vote123 views1 answer
How to fetch all chars of a string before a space in python
Python
10 votes145 views3 answers
Text recognition python library
Python
1 vote135 views1 answer
Anaconda install requests
Python
0 vote131 views1 answer
Multipart/form data multipart encoder python
Python
35 votes150 views5 answers
Python logging levels
Python