/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

3 votes277 views1 answer
How to make a star in python turtle
Python
8 votes272 views3 answers
Python is integer string
Python
0 vote307 views1 answer
Multi line cooment in python
Python
1 vote293 views1 answer
Django foreign key field on delete do nothing
Python Django
6 votes261 views4 answers
Get channel from id discord.py
Python
35 votes255 views2 answers
How to do the sum of list in python
Python
2 votes273 views2 answers
Can you edit string.punctuation
Python
7 votes257 views1 answer
How to give column names in pandas when creating dataframe
Python
0 vote269 views1 answer
How to plot a linear equation in matplotlib
Python
0 vote326 views1 answer
Python check disk space
Python