@@ -0,0 +1,774 @@
+import java.io.*;%0Aimport java.util.*;%0A%0Apublic class Solution %7B%0A%0A    public static void insertionSort(int%5B%5D A)%7B%0A        for(int i = 1; i %3C A.length; i++)%7B%0A            int value = A%5Bi%5D;%0A            int j = i - 1;%0A            while(j %3E= 0 && A%5Bj%5D %3E value)%7B%0A                A%5Bj + 1%5D = A%5Bj%5D;%0A                j = j - 1;%0A            %7D%0A            A%5Bj + 1%5D = value;%0A        %7D%0A%0A        printArray(A);%0A    %7D%0A%0A%0A    static void printArray(int%5B%5D ar) %7B%0A        for(int n: ar)%7B%0A            System.out.print(n+%22 %22);%0A        %7D%0A    %7D%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        int n = in.nextInt();%0A        int%5B%5D ar = new int%5Bn%5D;%0A        for(int i=0;i%3Cn;i++)%7B%0A            ar%5Bi%5D=in.nextInt();%0A        %7D%0A        insertionSort(ar);%0A    %7D%0A%7D%0A

fix small bug in correctness and loop invariant code