/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

-1 vote228 views1 answer
Decimal conversion python
Python
3 votes228 views1 answer
Python plot frequency of column values
Python
0 vote238 views1 answer
Waitkey in python
Python
16 votes235 views3 answers
Python gitignore
Python
5 votes221 views4 answers
Dropna for specific column pandas
Python
13 votes221 views2 answers
How to append to text file with new line by line in python
Python
0 vote239 views1 answer
Run django localhost server
Python Django
-1 vote232 views1 answer
What is append use
Python
24 votes202 views7 answers
Python timer
Python
0 vote227 views2 answers
Re.add python
Python