/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 vote108 views1 answer
Python how to find the highest even in a list
Python
0 vote103 views1 answer
DataFrame changed by function
Python
0 vote98 views1 answer
Python how to locate and fill a specific column null values
Python
0 vote133 views1 answer
Np print precision
Python
1 vote141 views3 answers
Management commands django
Python Django
0 vote97 views3 answers
Outliers removal
Python
0 vote74 views1 answer
Flask current_app config
Python Flask
0 vote103 views1 answer
Find the item with the maximum number of occurrences in a list in Python
Python
2 votes103 views2 answers
Get the first item in a list in python 3
Python
0 vote100 views1 answer
Sum with conditional python
Python