/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

1 vote249 views1 answer
Python function remove all whitespace from all character columns in dataframe
Python
3 votes238 views1 answer
Boto3 upload file to s3
Python
0 vote304 views1 answer
Sum first 100 integers in python
Python
3 votes252 views3 answers
Run flask in debug mode
Python
0 vote245 views1 answer
Fcn tensorflow
Python
0 vote250 views1 answer
Apply 2d mask to 3d array python
Python
0 vote248 views1 answer
Python take input without displaying it
Python
0 vote203 views1 answer
Max path limit python
Python
7 votes236 views4 answers
Pandas filter rows by value
Python
0 vote257 views3 answers
Autoextract scrapy spider
Python