insertion sort working

Author: amejiarosario

.node-version

@@ -1 +1 @@
-10
+10.12.0

book/chapters/insertion-sort.adoc

@@ -3,6 +3,8 @@
 Insertion sort is one of the most natural way of sorting. If you are given some cards that's probably how you are going to sort the.
 
 .This is how it works:
+. Start with the first element, assume that everything to its left is sorted and everything to the right is not.
+. Move to the next element.
 
 . Take the first element and consider it sorted.
 . Take the 2nd element, compare it with the first element. It 2nd is smaller swap it with the first element.

package-lock.json

@@ -4,15 +4,12 @@ function insertionSort(collection) {
   const array = Array.from(collection);
 
   for (let outer = 1; outer < array.length; outer += 1) {
-    const insert = array[outer];
-
-    for (let inner = outer - 1; inner >= 0; inner -= 1) {
-      const element = array[inner];
-
-      if (insert < element) {
-        swap(array, inner, outer);
-      }
-    }
+    let inner;
+    for (inner = outer - 1;
+      inner >= 0 && array[outer] < array[inner];
+      inner -= 1) {}
+    const [insert] = array.splice(outer, 1);
+    array.splice(inner + 1, 0, insert);
   }
   return array;
 }

src/algorithms/sorting/insertion-sort.js

@@ -1,5 +1,6 @@
 const sortingAlgorithms = [
   require('./selection-sort'),
+  require('./insertion-sort'),
 ];
 
 sortingAlgorithms.forEach((sort) => {