/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 vote139 views1 answer
Python sqlobject declare connection
Python
0 vote156 views3 answers
Gau mata
Python
1 vote143 views1 answer
Break out of 2 loops python
Python
0 vote156 views1 answer
Python remove punctuation from a string
Python
0 vote140 views1 answer
Multivariable traces f(x, y) = sin(x)cos(y)
Python
0 vote147 views1 answer
Python print os command output -1
Python
1 vote153 views1 answer
Python letter arr
Python
0 vote147 views1 answer
Python tkinter frame title
Python
29 votes154 views9 answers
Traduttore
Python
0 vote143 views1 answer
Python operator overloading deal with type
Python