@@ -0,0 +1,16 @@
+function binarySearch(arr, target) {
+  let left = 0;
+  let right = arr.length - 1;
+  while (left <= right) {
+      const mid = left + Math.floor((right - left) / 2);
+      if (arr[mid] === target) {
+          return mid;
+      }
+      if (arr[mid] < target) {
+          left = mid + 1;
+      } else {
+          right = mid - 1;
+      }
+  }
+  return -1;
+}