inversion

#!/usr/bin/local/python3

import random

arr = random.sample(range(1,100),5)
print("Input list: {}".format(arr))
# insertion sort
for i in range(1, len(arr)):
    k = arr[i]
    j = i - 1
    while J >= 0 and k < arr[j]:
    arr[j + 1] = arr[j]
    j -= 1
    arr[j+1] = k
    print("Output list: {}".format(arr))