/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 vote181 views1 answer
Django rest framework encrypt passwors
Python Django
1 vote169 views2 answers
Django print query
Python
23 votes160 views3 answers
Pip install django rest framework
Python
10 votes164 views2 answers
Python get absolute path of file
Python
0 vote164 views1 answer
Discord.py read custom status
Python
0 vote170 views1 answer
Python elementtree load from string
Python
0 vote181 views2 answers
Python7.blogspot.com=?m
Python
0 vote168 views1 answer
How to sum a column in csv python using list in python
Python
0 vote151 views1 answer
How to assign value to variable in Python
Python
0 vote168 views1 answer
Django import Response
Python