/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

21 votes173 views3 answers
How to copy all requirements to requirements.txt
Python
0 vote161 views1 answer
Bfs in python 3
Python
13 votes195 views1 answer
Python read file to variable
Python
1 vote221 views1 answer
Filter with different operator in django
Python Django
1 vote173 views1 answer
Convert to lowercase command python
Python
0 vote237 views1 answer
Shebang line python
Python
1 vote190 views1 answer
Cut part of video ffmpeg
Python
2 votes198 views2 answers
Python coding questions and answers
Python
5 votes181 views1 answer
Mongodb group by having
Python
1 vote187 views1 answer
Create zero array in python
Python