/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

27 votes290 views4 answers
How to do a square root in python
Python
1 vote262 views1 answer
Pyhton find dates in weeks
Python
1 vote289 views1 answer
How to slice dataframe based on daterange in pandas
Python
0 vote295 views1 answer
Pandas df make set index column
Python
0 vote285 views1 answer
C# dictionary values to array
Python
0 vote300 views1 answer
Python replace \n with something else
Python
0 vote294 views1 answer
Como fazer um bot spamm no discord com python
Python
9 votes294 views6 answers
Python def
Python
1 vote304 views1 answer
What is serialization in django
Python Django
0 vote280 views1 answer
Python list key string
Python