/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 vote232 views1 answer
Python returned non-zero exit status 1.
Python
0 vote147 views1 answer
Uneven chunks of array slices
Python
55 votes261 views5 answers
Python parse date
Python
1 vote217 views2 answers
How to access cookies in django
Python
139 votes202 views6 answers
Anaconda create new environment
Python
91 votes195 views6 answers
How to create a virtual environment in python
Python
1 vote190 views2 answers
Number of columns with no missing values
Python
-3 votes229 views5 answers
Multiplication table in python
Python
15 votes208 views1 answer
My python app is not quittting
Python
3 votes205 views1 answer
Python initialize multidimensional list
Python