Initial upload - Algorithm Visualizer

Author: CBodirsky

.gitignore

@@ -0,0 +1,30 @@
+### IntelliJ IDEA ###
+out/
+!**/src/main/**/out/
+!**/src/test/**/out/
+.kotlin
+
+### Eclipse ###
+.apt_generated
+.classpath
+.factorypath
+.project
+.settings
+.springBeans
+.sts4-cache
+bin/
+!**/src/main/**/bin/
+!**/src/test/**/bin/
+
+### NetBeans ###
+/nbproject/private/
+/nbbuild/
+/dist/
+/nbdist/
+/.nb-gradle/
+
+### VS Code ###
+.vscode/
+
+### Mac OS ###
+.DS_Store

.idea/.gitignore

@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="library" name="core-4.5.2" level="project" />
+  </component>
+</module>

.idea/libraries/core_4_5_2.xml

@@ -0,0 +1,79 @@
+package algorithms;
+
+public class BubbleSort implements SortAlgorithm {
+    private int i = 0;
+    private int j = 0;
+    private int swapA;
+    private int swapB;
+    private boolean finished = false;
+    private boolean didSwap = false;
+    int[] arr;
+
+    public int getI() { return i; }
+    public int getJ() { return j; }
+    public boolean didSwap() { return didSwap; }
+
+    @Override
+    public boolean isFinished() { return finished; }
+
+    @Override
+    public int[] getActiveIndices() {
+        //stay in bounds, don't compare what's already sorted
+//        if (j >= arr.length - i - 1) return null;
+        //Currently active pair being compared
+        return new int[] { j, j+1 };
+    }
+
+    @Override
+    public int[] getSwapIndices() {
+        //get swapping pair
+        return didSwap ? new int[] {swapA, swapB} : null;
+    }
+
+    public BubbleSort(int[] arr) {
+        this.arr = arr;
+    }
+
+    public int[] getArray() {
+        return arr;
+    }
+
+    // returns true when finished
+    @Override
+    public boolean step() {
+//        System.out.println("Sorting array hash: " + System.identityHashCode(arr));
+        didSwap = false;
+        if (finished) return false;
+
+        if (i < arr.length - 1) {
+            if (j < arr.length - i - 1) {
+
+                // Compare
+                if (arr[j] > arr[j + 1]) {
+
+                    swapA = j;
+                    swapB = j + 1;
+                    // Swap
+                    int temp = arr[j];
+                    arr[j] = arr[j + 1];
+                    arr[j + 1] = temp;
+
+                    didSwap = true;
+
+                    return true;
+                }
+
+                j++;
+                return false;
+            } else {
+                j = 0;
+                i++;
+            }
+        } else {
+            finished = true;
+        }
+
+
+        return false;
+    }
+}

.idea/misc.xml

@@ -0,0 +1,4 @@
+package algorithms;
+
+public class InsertionSort {
+}

.idea/modules.xml

@@ -0,0 +1,4 @@
+package algorithms;
+
+public class MergeSort {
+}

AlgoVisualizer.iml

@@ -0,0 +1,20 @@
+package algorithms;
+
+public interface SortAlgorithm {
+
+    /** Perform one step of the algorithm.
+     *  Return true if a swap occurred (so animations can trigger).
+     */
+    boolean step();
+
+    /** Return true when the algorithm is finished. */
+    boolean isFinished();
+
+    /** Return the currently active indices being compared. */
+    int[] getActiveIndices();
+
+    /** Return the indices that were swapped on the last step. */
+    int[] getSwapIndices();
+
+    int[] getArray();
+}