/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

0 vote323 views1 answer
Sys.path.append python
Python
0 vote352 views1 answer
How to make a column a factor in pandas
Python
0 vote324 views1 answer
Check processing bar of loop in python
Python
5 votes330 views1 answer
Python plot multiple lines in same figure
Python
7 votes342 views1 answer
Python html to pdf
Python
0 vote317 views1 answer
Tuple index in python
Python
0 vote335 views1 answer
Python enumerate list with comprehension
Python
1 vote320 views1 answer
Log base 2 python
Python
0 vote330 views1 answer
Inicio programacao python
Python
0 vote353 views2 answers
Matplotlib increase tick frequency
Python