/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 vote262 views1 answer
Sns title
Python
-1 vote257 views1 answer
How to delete django superuser
Python
1 vote283 views1 answer
Stop a function from continuing when a condition is met python
Python
0 vote293 views1 answer
How to plot box plot python
Python
7 votes248 views2 answers
What is numpy
Python
1 vote253 views1 answer
Punctuation list python
Python
0 vote245 views1 answer
Odoo site map for employees hierarchy
Python
0 vote241 views2 answers
Change date format to yyyy mm dd in django template datepicker
Python
0 vote261 views1 answer
How to change speed in ursina
Python
5 votes257 views1 answer
Python remove punctuation from text file
Python