/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

4 votes197 views1 answer
Replace empty string and "records with only spaces" with npnan pandas
Python
-1 vote207 views1 answer
Create close python program in puthon
Python
0 vote209 views1 answer
How to find most repeated word in a string in python
Python
0 vote206 views1 answer
Bracket balanced or not in python
Python
0 vote201 views1 answer
How to run shell command ctrl + c in python script
Python
0 vote209 views1 answer
Clear cookies selenium python
Python
17 votes247 views4 answers
Substring in python
Python
2 votes229 views1 answer
Django and react url conflict
Python Django
0 vote211 views1 answer
Scipy version check
Python
8 votes222 views2 answers
Linear search in python
Python