Run
def insertion_sort(nlist): for i in range(1, len(nlist)): temp = nlist[i] j = i - 1 while (j >= 0 and temp < nlist[j]): nlist[j + 1] = nlist[j] j = j - 1 nlist[j + 1] = temp # Input list alist = [1, 74, 96, 5, 42, 63] print('Input List\n', alist) # Sort list insertion_sort(alist) print('Sorted List\n', alist)
Output