recursive binary search in js

Author: lgope

algorithms/binarySearchRecursive.js

@@ -0,0 +1,19 @@
+function binarySearch(arr, val, start = 0, end = arr.length - 1) {
+  const mid = Math.floor((start + end) / 2);
+
+  if (val === arr[mid]) {
+    return mid;
+  }
+
+  if (start >= end) {
+    return -1;
+  }
+
+  return val < arr[mid]
+    ? binarySearch(arr, val, start, mid - 1)
+    : binarySearch(arr, val, mid + 1, end);
+}
+
+let arr = [1, 2, 4, 6, 100, 10000];
+
+console.log(binarySearch(arr, 2));