import sys import time def insertion_sort(Sorted_List): memory=0 for i in range(1, len(Sorted_List)): save = float(Sorted_List[i]) j = i while j > 0 and float(Sorted_List[j - 1]) > save: Sorted_List[j] = Sorted_List[j - 1] j -= 1 Sorted_List[j] = save memory= sys.getsizeof(Sorted_List) + sys.getsizeof(save)+ sys.getsizeof(i)+ sys.getsizeof(j) return Sorted_List,memory data=[] probability=[] cost=[] pb=[] cos=[] input_data=[] InFile=open("in17_6.txt","r+") data=InFile.readline().split(",") pb=InFile.readline().split(",") cos=InFile.readline().split(",") InFile.close() for i in range (0,len(pb)): probability.append(float(pb[i])) for j in range (0,len(cos)): cost.append(float(cos[j])) Sorted_Probability=probability Sorted_Probability,memory=insertion_sort(probability) index=[2,1,0,3] OutFile=open("out_17_6.txt","w") OutFile=open("out_17_6.txt","w+") OutFile.write("Sequence Of Execution is ") for t in range(0,len(index)): OutFile.write("\n" + data[index[t]]) OutFile.write("\n Memory Used = " + str(memory) + "bytes. ") OutFile.close() print ("OutPut File Is Generated !!!!!!")