/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 vote157 views1 answer
Kivy date widget
Python
0 vote205 views1 answer
Error: Command '['/home/jonas/twitchslam/env/bin/python3.6', '-Im', 'ensurepip', '--upgrade', '--default-pip']' returned non-zero exit status 1.
Python
1 vote155 views1 answer
Python two while loops at same time
Python
1 vote132 views1 answer
Cannot import name 'abc' from 'bson.py3compat'
Python
2 votes156 views3 answers
Python split string size
Python
0 vote142 views1 answer
How to use event of Button in python
Python
0 vote149 views1 answer
Django import Response
Python
42 votes157 views6 answers
Pickle dump
Python
11 votes138 views6 answers
Write list to csv python
Python
-1 vote139 views1 answer
Pandas df multiindex
Python