1function binarySearch(arr, target) {
2 let left = 0, right = arr.length - 1;
3 while (left <= right) {
4 const mid = Math.floor((left + right) / 2);
5 if (arr[mid] === target) return mid;
6 else if (arr[mid] < target) left = mid + 1;
7 else right = mid - 1;
8 }
9 return -1;
10}