/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 vote314 views1 answer
Pygame mixer documentation
Python
14 votes338 views4 answers
Spyder python
Python
1 vote298 views2 answers
Numpy random for string
Python
2 votes312 views1 answer
How to save a model fast ai
Python
0 vote311 views1 answer
Email grabber python
Python
1 vote303 views1 answer
Def dft(self, array): stack = Stack() visited = set() stack.append(self) while len(stack) > 0 and while len(visited) >= 0: current = stack.pop() array.append(current) visited.add(current) return array
Python
1 vote282 views1 answer
Code that works if variable has a value python
Python
0 vote316 views1 answer
How to check if a list is nested or not
Python
0 vote318 views1 answer
Dependency on app with no migrations:
Python
0 vote321 views1 answer
Pandas name of day
Python