in a python i write a code but I found error in a other Test the program for the different size input files like "input_1000.txt", "input_5000.txt","input_10000.txt", "input_50000.txt", "input_100000.txt", "input_500000.txt".

Record the runtime for insertion sort on various sized arrays by using the provided files.

Comment on how the execution time of insertion sort varies with size of the input array. Use a

table or plot to summarize the results and document your observations and explanations in the

report.

def insertionSort(A):

for j in range(1,len(A)):

key = A[j]

i = j-1

while i >= 0 and A[i] > key:

A[i+1] = A[i]

i = i - 1

A[i+1] = key

return A

def driver():

with open ("input_100.txt") as read:

new = read.read()

newlist = new.split()

newlist = list(map(int , newlist))

insertionSort(newlist)

print(newlist)

driver()