Insertion-Sort on Java in Brute Force\Insertion Sort

Author: suiyueranzly

Brute Force/Insertion Sort/Code.java

@@ -0,0 +1,41 @@
+import org.algorithm_visualizer.*;
+import java.util.Arrays;
+
+class Main {
+
+    private static ChartTracer chartTracer = new ChartTracer();
+
+    private static LogTracer logTracer = new LogTracer("Console");
+
+    private static Integer[] array = (Integer[]) new Randomize.Array1D(15, new Randomize.Integer(1, 20)).create();
+
+    public static void main(String[] args) {
+        int length = array.length;
+        Layout.setRoot(new VerticalLayout(new Commander[]{chartTracer, logTracer}));
+        logTracer.printf("original array = %s\n", Arrays.toString(array));
+        chartTracer.set(array);
+        Tracer.delay();
+
+        for (int i = 1; i < length; i++) {
+            int j = i - 1;
+            int temp = array[i];
+            chartTracer.select(i);
+            Tracer.delay();
+            logTracer.printf("insert %s\n",temp);
+            while (j >= 0 && array[j] > temp) {
+                array[j + 1] = array[j];
+                chartTracer.patch(j + 1, array[j + 1]);
+                Tracer.delay();
+                chartTracer.depatch(j + 1);
+                j--;
+            }
+            array[j + 1] = temp;
+            chartTracer.patch(j + 1, temp);
+            Tracer.delay();
+            chartTracer.depatch(j + 1);
+            chartTracer.deselect(i);
+        }
+
+        logTracer.printf("sorted array = %s\n",Arrays.toString(array));
+    }
+}