@@ -0,0 +1,1624 @@
+import java.io.*;%0Aimport java.math.*;%0Aimport java.security.*;%0Aimport java.text.*;%0Aimport java.util.*;%0Aimport java.util.concurrent.*;%0Aimport java.util.regex.*;%0A%0Apublic class Solution %7B%0A%0A    // Complete the insertionSort1 function below.%0A    %0A    static void print(int%5B%5D arr)%7B%0A        for(int i=0;i%3Carr.length;i++)%7B%0A            System.out.print(arr%5Bi%5D+%22 %22);%0A        %7D%0A        System.out.println(%22 %22);%0A    %7D%0A    %0A    static void insertionSort1(int n, int%5B%5D arr) %7B%0A        int k=0;%0A        int a=0;%0A        for(int i=n-2;i%3E=0;i--)%7B%0A            a = arr%5Bi%5D;%0A            for(int j=i-1;j%3E=0;j--)%7B%0A                if(arr%5Bj%5D%3Ca)%7B%0A                    k = j;%0A                    //break;%0A                    for(int b=i-1; b%3Ek;b--)%7B%0A                        //int t=arr%5Bb+1%5D;%0A                        arr%5Bb+1%5D=arr%5Bb%5D;%0A                        //arr%5Bb+2%5D=t;%0A                    %7D%0A                    print(arr);%0A                    break;%0A                %7D%0A            %7D%0A            //arr%5Bk%5D=arr%5Bi%5D;%0A            %0A            arr%5Bk%5D=a;%0A        %7D%0A        %0A        print(arr);%0A    %7D%0A%0A    private static final Scanner scanner = new Scanner(System.in);%0A%0A    public static void main(String%5B%5D args) %7B%0A        int n = scanner.nextInt();%0A        scanner.skip(%22(%5Cr%5Cn%7C%5B%5Cn%5Cr%5Cu2028%5Cu2029%5Cu0085%5D)?%22);%0A%0A        int%5B%5D arr = new int%5Bn%5D;%0A%0A        String%5B%5D arrItems = scanner.nextLine().split(%22 %22);%0A        scanner.skip(%22(%5Cr%5Cn%7C%5B%5Cn%5Cr%5Cu2028%5Cu2029%5Cu0085%5D)?%22);%0A%0A        for (int i = 0; i %3C n; i++) %7B%0A            int arrItem = Integer.parseInt(arrItems%5Bi%5D);%0A            arr%5Bi%5D = arrItem;%0A        %7D%0A%0A        insertionSort1(n, arr);%0A%0A        scanner.close();%0A    %7D%0A%7D%0A

add InsertionSort1.java -- incompelete