#Takes as input two parameters: # price_list is a list of Order…
Question #Takes as input two parameters: # price_list is a list of Order… Image transcription textInstructions: [The template contains a function W that takes as input a list of Order objects Opresenting thepricing structure for the day and an integer, representing the minimum number of wings you need to order. Youcan assume that the list of Order objects is sorted from lowest number of wings to highest. You c… Show more… Show more#Takes as input two parameters:# price_list is a list of Order objects that represents today’s cost for a# single order of various quantities of chicken wings. You can assume that# price_list is always in order from lowest quantity of wings to highest,# but there is no guarantee that every integer between 1 and num_wings is# a valid order size# num_wings is an integer, representing the minimum number of chicken wings# you need to order today to send the correct message to the shadow# organization# Returns a list Order objects representing the set of wing orders with the# minimum total cost that contain at least num_wings wings.def optimize_wings(price_list,num_wings): class Order: def __init__(self,wings,price): self.wings = wings self.price = price def __repr__(self): return str(self.wings) + ” wings: $”+ str(self.price) def __eq__(self,other): return self.wings == other.wings and self.price == other.pricepL1 = [Order(1,4)]pL2 = [Order(1,2), Order(5,5), Order(7,6)]pL3 = [Order(1,2), Order(3,3), Order(4,6), Order(5,10), Order(6,11), Order(7,13), Order(8,14), Order(9,19)]pL4 = [Order(1,1), Order(2,5), Order(3,8), Order(4,9), Order(5,12), Order(6,17), Order(7,19), Order(8,20)]pL5 = [Order(1,4), Order(6,7), Order(8,9), Order(10,11), Order(12,16), Order(15,21), Order(24,24), Order(27,32), Order(30,34), Order(34,36), Order(37,39), Order(41,41), Order(48,49), Order(50,53)]pL6 = [Order(4,4.55), Order(5,5.70), Order(6,6.80), Order(7,7.95), Order(8,9.10), Order(9,10.20), Order(10,11.35), Order(11,12.50), Order(13,14.75), Order(14,15.90), Order(15,17.00), Order(16,18.15), Order(17,19.30), Order(18,20.40), Order(19,21.55), Order(20,22.70), Order(21,23.80), Order(22,24.95), Order(23,26.10), Order(24,27.25), Order(25,27.80), Order(26,28.95), Order(27,30.10), Order(28,31.20), Order(29,32.35), Order(30,33.50), Order(35,39.15), Order(40,44.80), Order(45,50.50), Order(50,55.60), Order(60,67.00), Order(70,78.30), Order(75,83.45), Order(80,89.10), Order(90,100.45), Order(100,111.25), Order(125,139.00), Order(150,166.85), Order(200,222.50)] price_lists = [ list(pL1),list(pL1),list(pL2),list(pL2),list(pL3),list(pL3), list(pL4),list(pL4),list(pL5),list(pL5),list(pL6),list(pL6)]wing_nums = [ 1, 3, 10, 15, 4, 8, 3, 6, 35, 55, 19, 394]correct = [[Order(1,4)], [Order(1,4), Order(1,4), Order(1,4)], [Order(5,5), Order(5,5)], [Order(7,6), Order(7,6), Order(1,2)], [Order(1,2), Order(3,3)], [Order(3,3), Order(3,3), Order(3,3)], [Order(1,1), Order(1,1), Order(1,1)], [Order(1,1), Order(1,1), Order(1,1), Order(1,1), Order(1,1), Order(1,1)], [Order(6,7), Order(6,7), Order(24,24)], [Order(6,7), Order(8,9), Order(41,41)], [Order(4,4.55), Order(6,6.80), Order(9,10.20)], [Order(25,27.80), Order(25,27.80), Order(25,27.80), Order(26,28.95), Order(28,31.20), Order(28,31.20), Order(28,31.20), Order(28,31.20), Order(28,31.20), Order(28,31.20), Order(125,139.00)]]def compute_cost(price_list, orders): total = 0 for ele in orders: assert ele in price_list, “Invalid order “+str(ele) total += ele.price return total#Run test casescount = 0try: for i in range(len(price_lists)): if i%2 == 0: print(“n—————————————n”) print(“Price List: “) for ele in price_lists[i]: print(ele) print(“n”) print(“TEST #”,i+1) print(“Wings needed:”,wing_nums[i]) out_orders = optimize_wings(price_lists[i],wing_nums[i]) corr_orders = correct[i] corr_cost = round(compute_cost(price_lists[i],corr_orders),2) print(“Optimal Order:”,corr_orders,” Cost $”+str(corr_cost)) for ele in out_orders: assert type(ele) == Order, str(ele)+” in output list: “+str(out_orders)+ ” is not an Order object” out_cost = round(compute_cost(price_lists[i],out_orders),2) print(“Output Order:”,out_orders,” Cost $”+str(out_cost)) assert sum(map(lambda x: x.wings,out_orders)) >= wing_nums[i], “Insufficient total wings ordered!” assert corr_cost == out_cost, “wings order not cheapest possible!” print(“Test Passed!n”) count += 1except AssertionError as e: print(“nFAIL: “,e)except Exception: print(“nFAIL: “,traceback.format_exc())print(count,”out of”,len(price_lists),”tests passed.”) Computer Science Engineering & Technology Python Programming CSC 4041 Share QuestionEmailCopy link Comments (0)
