Fix the indentation & codding style of insertion binary sort

Author: mgechev

src/sorting/insertionsort/insertion-binary-sort.js

@@ -1,5 +1,3 @@
-var array = [5,6,3,3,6,8,9,4,3];
-
 /**
  * Modified version of insertionsort. It uses binary search for finding
  * where the current element should be inserted. It's correct because
@@ -11,27 +9,27 @@ var array = [5,6,3,3,6,8,9,4,3];
  * @param {array} array Sorted array
  */
 function insertionBinarySort(array) {
-    var current,
-        middle,
-        left,
-        right;
-    for (var i = 1; i < array.length; i += 1) {
-        current = array[i];
-        left = 0;
-        right = i;
-        middle = Math.floor((left + right) / 2);
-        while (left < right) {
-            if (array[middle] <= current) 
-                left = middle + 1;
-            else 
-                right = middle - 1;
-            middle = Math.floor((left + right) / 2);
-        }
-        for (var j = i; j > middle; j -= 1) 
-            array[j] = array[j - 1];
-        array[j] = current;
+  var current,
+      middle,
+      left,
+      right;
+  for (var i = 1; i < array.length; i += 1) {
+    current = array[i];
+    left = 0;
+    right = i;
+    middle = Math.floor((left + right) / 2);
+    while (left < right) {
+      if (array[middle] <= current) {
+        left = middle + 1;
+      } else {
+        right = middle - 1;
+      }
+      middle = Math.floor((left + right) / 2);
     }
-    return array;
-}
-
-console.log(insertionBinarySort(array));
+    for (var j = i; j > middle; j -= 1) {
+      array[j] = array[j - 1];
+    }
+    array[j] = current;
+  }
+  return array;
+}