Insertion Sort - Part 1

import math
import os
import random
import re
import sys



def insertionSort1(n, arr):
    pointer = n-1 
    while pointer and arr[pointer - 1] > arr[pointer]:
        temp = arr[pointer]
        arr[pointer] = arr[pointer-1]
        print(*arr)
        arr[pointer-1] = temp 
        pointer -= 1 
    print(*arr)

if __name__ == '__main__':
    n = int(input().strip())

    arr = list(map(int, input().rstrip().split()))

    insertionSort1(n, arr)