Question

USE PYTHON / RECURSION METHOD

Fibonacci Dictionary Function Name: fibtionary Parameters: num (int) Returns: dictionary (key: int, value: int) Description: You're done with stats, but you still have other math homework to go! You're currently learning about the Fibonacci sequence in math class. The Fibonacci sequence is a series of numbers in the pattern 112 3 5 8 13 21 ..., where the next number is found by adding up the two numbers before it. Write a function that takes in a num (int), and returns a dictionary whose keys are the numbers from 1 to num and the values are the corresponding fibonacci numbers at that position. The numbers passed in will always be positive. >>> num1 = 5 >>> print (fibtionary(num1)) {1: 1, 2: 1, 3: 2, 4: 3, 5: 5} >>> num2 = 2 >>> print (fibtionary(num2)) {1: 1, 2: 1}

Answer 1

# STAY HOME # STAY SAFE
# initialize a global dictionary
di={1:1,2:1}
pos=3
limit=0
flag=1

# recursive function fibtionary
def fibtionary(num):
# use the global variables
global pos,limit,flag
global di
# set the value of limit as num
if(flag==1):
limit=num
flag=0
  
# if num is 1 then return {1:1}
if(num==1):
return {1:1}
# if num is 2 then return di
if(num==2):
return di
else:
# else build the dictionary and recursively call the function until the pos reaches the limit
di[pos]=di[pos-1]+di[pos-2]
pos=pos+1
# if the pos becomes greater than limit then return di
if(pos>limit):
return di
# else call the function recursively
else:
return fibtionary(pos)

  
num1 = 5
print(fibtionary(num1))

In [15]: #STAY HOME #STAY SAFE # initial in a global dictionary di (1:1, 2:1) pos=3 limite flap-1 # recursive function fibtionary def fibtionary(nun): # use the global variables klobal pos, limil, flag global di set the value of Limit as nun 1+1+legesi): limitanum flapse 4 run is then retur /1:7) if(num==1): return 11:11 # if num is 2 then return di 11(nun==2): return di else: #else build the dictionary and recursively call the function until the pos reaches the limit Ji[pos]=i[pos-1]+ui [pos-2] posapos1 # if the pos becomes greater than limit then return di 11(poslimit): return di #else call the function recursively else: return fibtionary(pos) num= 5 print(fibtionary(nuni)) {1: 1, 2:1, 1:2, 4:3, 5:5}

In 16]: STAY HONE STAY SAFE initialize a global dictionary dis 1:1, 2:1} posm3 linite fla=1 # recursive function fibtionary det fibtionary(run): # use the global variables global pos, linit, flag global di # set the value of limit nu if(rass): linitanum Flag=0 # if nuk is I then return (1:1) if(num ): return (1:1) #fnun is then pun di if(num== 2): return di else: #clce build the dictionary and recursively call the function until the pos reaches the limit di [pasladi[pos-1]+di[pos-2] Ραερος # if the pos becomes greater than Liuit then return de if(poslimit); return di #else call the function recursively else: return fibtionary(pos) print(fibtionary(nunt)) {1:1, 2: 11