BinarySearch

function binarySearch(arr, value) {
let start = 0;
let end = arr.length - 1;
while (start <= end) {
let mid = Math.floor((start + end)/2);
if (arr[mid] === value) {
return mid;
}
if (arr[mid] < value) {
start = mid + 1;
} else {
end = mid - 1;
}
}
return -1;
}

const numbers = [2, 5, 9, 15, 22];
const target = 22;
const result = binarySearch(numbers, target);

console.log(result);