/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 vote118 views1 answer
Get first letter of each word in string python
Python
4 votes114 views1 answer
Server on python with address and port
Python
0 vote109 views1 answer
1 12 123 python
Python
3 votes152 views2 answers
Change django administration title
Python Django
6 votes130 views2 answers
Run python version from terminal
Python
0 vote117 views1 answer
Django form custom validation
Python
0 vote112 views1 answer
Root = tk() python 3
Python
21 votes137 views4 answers
Send dm discord py
Python
1 vote151 views1 answer
Hex to binary python3
Python
0 vote119 views1 answer
Python3 paramiko read stdout
Python