1
function binarySearch(arr, target) {
2
let low = 0;
3
let high = arr.length - 1;
4
5
while (low <= high) {
6
let mid = Math.floor((low + high) / 2);
7
8
if (arr[mid] === target) {
9
return mid;
10
} else if (arr[mid] < target) {
11
low = mid + 1;
12
} else {
13
high = mid - 1;
14
}
15
}
16
17
return -1;
18
}