Solution.java

import java.io.*;
import java.util.*;

public class Solution {

    public static void insertionSortPart2(int[] ar) {
        for (int i = 1; i < ar.length; i++) {
            int tmp = ar[i];
            int j = i - 1;
            while (j >= 0 && tmp < ar[j]) {
                ar[j+1] = ar[j];
                j--;
            }
            ar[j+1] = tmp;
            Solution.printArray(ar);
        }
    }



    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
       int s = in.nextInt();
       int[] ar = new int[s];
       for(int i=0;i<s;i++){
            ar[i]=in.nextInt();
       }
       insertionSortPart2(ar);

    }
    private static void printArray(int[] ar) {
      for(int n: ar){
         System.out.print(n+" ");
      }
        System.out.println("");
   }
}