No frills implementation of Insertion sort.

nirupa-kumar · nirupa-kumar · commit 721bad09e3c8 · 2018-08-10T16:24:23.000-07:00
diff --git a/DataStructureImplementations/insertionSort.js b/DataStructureImplementations/insertionSort.js
@@ -0,0 +1,15 @@
+var insertionSort = function(unsorted){
+  for(var i=0;i<unsorted.length;i++){
+    var temp = unsorted[i];
+    j=i-1;
+    while((j>=0)&&(unsorted[j]>temp)){
+      unsorted[j+1]=unsorted[j];
+      j--;
+    }
+    unsorted[j+1] = temp;
+  }
+
+  return unsorted;
+}
+
+console.log(insertionSort([2,5,7,4,8,10]));
