No frills implementation of Binary Search.

nirupa-kumar · nirupa-kumar · commit 8bbe43d03f68 · 2018-08-11T23:45:44.000-07:00
diff --git a/DataStructureImplementations/binarySearch.js b/DataStructureImplementations/binarySearch.js
@@ -0,0 +1,19 @@
+var binarySearch = function(num,inputArray){
+  var minIndex = 0;
+  var maxIndex = inputArray.length-1;
+  var currIndex;
+  var currElement;
+  while(minIndex<=maxIndex){
+    currIndex = (maxIndex-minIndex)/2|0;
+    currElement = inputArray[currIndex];
+    if(num<currElement){
+      maxIndex = currIndex-1;
+    }else if(num>currElement){
+      minIndex = currIndex+1;
+    }
+    else{
+    return currIndex;
+    }
+  }
+return -1;
+}
