/Python/Fibonacci series python recursion

Fibonacci series python recursion

# By recursion
def fib(n):
    if n == 1 or n == 2:
        return 1 
    else:
        return(fib(n-1) + fib(n-2))
        
n = 6
for i in range(1,n+1):
    print(fib(i))

Fibonacci sequence python

# WARNING: this program assumes the
# fibonacci sequence starts at 1
def fib(num):
  """return the number at index num in the fibonacci sequence"""
  if num <= 2:
    return 1
  return fib(num - 1) + fib(num - 2)


print(fib(6))  # 8

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))

-1

Source: pythonclass.in

Similar codes

2 votes145 views2 answers
Pipenv freeze requirements.txt
Python
2 votes166 views1 answer
Fill zero behind number python
Python
1 vote155 views1 answer
Object literal python
Python
0 vote188 views1 answer
How to find position of a character in a string from right sidepython
Python
0 vote163 views1 answer
Python beautifulsoup xpath
Python
0 vote119 views1 answer
Returns all the records as a list of Row
Python
6 votes149 views2 answers
Import numpy as np arr = np.array([[ 1, 2, 3], [2, 4, 6]]) arr. min ( =0)
Python
2 votes153 views2 answers
Print the number of times that the substring occurs in the given string
Python
0 vote151 views1 answer
How to get input from user in python with out press enter
Python
1 vote147 views2 answers
How to find the shortest word in a list python
Python