Python: I want code implemented to find the average time and loop number for the insertion sort if it were to run 10 times burning the first run cause that one would always take much longer than the others

My code

import random def InsertionSort(list, N): for i in range(1, N): newElement = list[i] location = i - 1 while (location >= 0 and list[location] > newElement): list[location + 1] = list[location] location = location - 1 list[location + 1] = newElement myList = [] for i in range(0, 100): n = random.randint(1, 100) myList.append(n) print("Random:") print(myList) print(" Sorted: ") InsertionSort(myList, 100) print(myList) print(" N :", len(myList)) 

The desire output

C:\TAMUCT\202101 CIS 4340 - Algorithm Design and Analysis Projects Assignment3\bin\Debug Assignment3.exe Random: 99 28 29 74 93 77 31 27 35 58 3 38 33 60 4 73 57 41 64 7 4 64 24 20 33 90 4 47 42 47 87 81 49 62 10 63 47 49 55 61 88 5 83 38 17 95 74 12 66 2 7 72 75 90 35 36 5 9 42 3 73 84 86 89 71 23 90 72 50 42 26 8 87 4 20 100 82 86 4 38 17 92 81 40 4 1 16 7 60 27 75 58 38 8 52 88 4 19 94 67 95 Sorted: 2 3 3 4 4 4 4 4 4 5 5 7 7 7 8 8 9 10 12 16 17 17 19 20 20 23 24 26 27 27 28 29 31 33 33 35 35 36 38 38 38 38 40 41 41 42 42 42 47 47 47 49 49 50 52 55 57 58 58 60 60 61 62 63 64 64 66 67 71 72 72 73 73 74 74 75 75 77 81 81 82 83 84 86 86 87 87 88 88 89 90 90 90 92 93 94 95 95 99 100 N: 100 Average time: Average loop: ms