def isort(a):
  for i in range(len(a)):
    v = a[i]
    j = i
    while (a[j-1] > v) and (j > 0):
      a[j] = a[j-1]
      j = j - 1
    a[j] = v
    print(a)
  return a

from random import randrange
n = 19
a = [randrange(1, 10) for i in range(n)]
isort(a)