Add selection sort and insert sort

Author: Hopson97

src/main/java/sortVisualiser/SortArray.java

@@ -7,6 +7,7 @@
 import java.util.Random;
 import javax.swing.JPanel;
 import static util.Sleep.microsecondsToNano;
+import static util.Sleep.millisecondsToNano;
 import static util.Sleep.sleepFor;
 
 /**
@@ -49,7 +50,14 @@ public void swapUpdate(int firstIndex, int secondIndex) {
         barColours[secondIndex] = 100;
 
         repaint();
-        sleepFor(microsecondsToNano(10000));
+        sleepFor(millisecondsToNano(15));
+    }
+    
+    public void updateSingle(int index, int value) {
+        array[index] = value;
+        barColours[index] = 100;
+        repaint();
+        sleepFor(millisecondsToNano(15));
     }
 
     /**

src/main/java/sortVisualiser/SortVisualiser.java

@@ -4,6 +4,8 @@
 import javax.swing.JFrame;
 import sortVisualiser.algorithms.BubbleSort;
 import sortVisualiser.algorithms.ISortAlgorithm;
+import sortVisualiser.algorithms.InsertionSort;
+import sortVisualiser.algorithms.SelectionSort;
 import sortVisualiser.algorithms.Shuffle;
 import static util.Sleep.secondsToNano;
 import static util.Sleep.sleepFor;
@@ -32,6 +34,8 @@ public SortVisualiser() {
         window.setVisible(true);
 
         sortQueue = new ArrayList<>();
+        sortQueue.add(new SelectionSort());
+        sortQueue.add(new InsertionSort());
         sortQueue.add(new BubbleSort());
     }
 
@@ -49,7 +53,7 @@ private void shuffleAndWait() {
 
     public void run() {
         for (ISortAlgorithm algorithm : sortQueue) {
-            sleepFor(secondsToNano(2));
+            sleepFor(secondsToNano(1));
             shuffleAndWait();
             algorithm.runSort(sortArray);
             sortArray.resetColours();

src/main/java/sortVisualiser/algorithms/InsertionSort.java

@@ -0,0 +1,25 @@
+package sortVisualiser.algorithms;
+
+import sortVisualiser.SortArray;
+
+/**
+ * Insertion sort implementation
+ * @author Matthew Hopson
+ */
+public class InsertionSort implements ISortAlgorithm
+{
+
+    @Override
+    public void runSort(SortArray array) {
+        for (int i = 0; i < array.arraySize(); i++) {
+            int key = array.getValue(i);
+            int j = i - 1;
+            while (j >= 0 && array.getValue(j) > key) {
+                array.updateSingle(j + 1, array.getValue(j));
+                j--;
+            }
+            array.updateSingle(j + 1, key);
+        }
+    }
+
+}

src/main/java/sortVisualiser/algorithms/SelectionSort.java

@@ -0,0 +1,23 @@
+package sortVisualiser.algorithms;
+
+import sortVisualiser.SortArray;
+
+/**
+ * Selection sort implementation
+ * @author Matt Hopson
+ */
+public class SelectionSort implements ISortAlgorithm
+{
+    @Override
+    public void runSort(SortArray array) {
+        for (int i = 0; i < array.arraySize() - 1; i++) {
+            int minIndex = i;
+            for (int j = i + 1; j < array.arraySize(); j++) {
+                if (array.getValue(j) < array.getValue(minIndex)) {
+                    minIndex = j;
+                }
+            }
+            array.swapUpdate(i, minIndex);
+        }
+    }
+}