Insertion_Sort _Part_2.py

def insertionSort2(n, a):
    for i in range(1,n):
        key=a[i]
        j=i-1
        while j>=0 and a[j]>key:
            a[j+1]=a[j]
            j=j-1
        a[j+1]=key
        print(*a)