import time
import numpy as np
def insertion_sort(A):
sorted_subarray = [A[0]]
for key in A[1:]:
position = len(sorted_subarray)
while key < sorted_subarray[position - 1]:
if position == 1:
position -= 1
break
else:
position -= 1
sorted_subarray.insert(position, key)
return sorted_subarray
start = time.time()
for i in range(0, 1000):
a = list(np.random.randint(0, 100, size=10))
print(insertion_sort(a))
end = time.time()
print(end-start)