Insertion sort

package.json

@@ -1,6 +1,6 @@
 {
   "name": "sorting-javascript",
-  "version": "0.0.4",
+  "version": "0.0.5",
   "description": "Sorting algorithms implemented in JS",
   "repository": "neeleshroy/sorting-js",
   "author": "Neelesh Roy",

src/insertion-sort/index.js

@@ -0,0 +1,14 @@
+export function insertionSort(arr) {
+  const unsorted = arr;
+
+  for (let i = 1; i < unsorted.length; i++) {
+    for (let j = 0; j < i; j++) {
+      if (unsorted[i] < unsorted[j]) {
+        const spliced = unsorted.splice(i, 1);
+        unsorted.splice(j, 0, spliced[0]);
+      }
+    }
+  }
+
+  return unsorted;
+}

test/insertion-sort.test.js

@@ -0,0 +1,33 @@
+/**
+ * sorting-js
+ *
+ * Copyright © 2018 Neelesh Roy. All rights reserved.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE.txt file in the root directory of this source tree.
+ */
+
+import { expect } from 'chai';
+import { insertionSort } from '../src/insertion-sort';
+
+describe('Insertion Sort', () => {
+
+  describe('Insertion - function', () => {
+
+    it('should return empty array', () => {
+      const test = [];
+
+      const out = insertionSort(test);
+
+      expect(out).to.eql([]);
+    });
+
+    it('should sort the elements in ascending order', () => {
+      const test = [2, 5, 4, 10, 5, 3, 2, 7];
+
+      const out = insertionSort(test, 'a');
+
+      expect(out).to.eql([2, 2, 3, 4, 5, 5, 7, 10]);
+    });
+  });
+});