@@ -0,0 +1,1036 @@
+package algorithm;%0D%0A%0D%0Aimport java.util.Scanner;%0D%0A%0D%0Apublic class RunningTime %7B%0D%0A%0D%0A    public static class Solution %7B%0D%0A%0D%0A        public static void insertionSort(int%5B%5D A) %7B%0D%0A            int count = 0;%0D%0A            for (int i = 1; i %3C A.length; i++) %7B%0D%0A                int value = A%5Bi%5D;%0D%0A                int j = i;%0D%0A                while (j %3E 0 && A%5Bj - 1%5D %3E value) %7B%0D%0A                    A%5Bj%5D = A%5Bj - 1%5D;%0D%0A                    j = j - 1;%0D%0A                    count++;%0D%0A                %7D%0D%0A                A%5Bj%5D = value;%0D%0A            %7D%0D%0A            System.out.println(count);%0D%0A        %7D%0D%0A%0D%0A        public static void main(String%5B%5D args) %7B%0D%0A            try (Scanner in = new Scanner(System.in)) %7B%0D%0A                int n = in.nextInt();%0D%0A                int%5B%5D ar = new int%5Bn%5D;%0D%0A                for (int i = 0; i %3C n; i++) %7B%0D%0A                    ar%5Bi%5D = in.nextInt();%0D%0A                %7D%0D%0A                insertionSort(ar);%0D%0A            %7D%0D%0A        %7D%0D%0A    %7D%0D%0A%0D%0A    public static void main(String%5B%5D args) %7B%0D%0A        Solution.main(null);%0D%0A    %7D%0D%0A%0D%0A%7D

Add RunningTime task