// your code goes here
function binarySearch(arr, n, target) {
let left=0, right = n-1, mid;
while(left<=right) {
mid = Math.floor((left+right)/2);
if(arr[mid] > target) {
right = mid-1;
} else if(arr[mid] < target) {
left = mid+1;
} else {
return mid;
}
}
return -1;
}
console.log(binarySearch([2, 4, 5, 7, 8, 9, 11], 7, 3))
Ly8geW91ciBjb2RlIGdvZXMgaGVyZQoKZnVuY3Rpb24gYmluYXJ5U2VhcmNoKGFyciwgbiwgdGFyZ2V0KSB7CglsZXQgbGVmdD0wLCByaWdodCA9IG4tMSwgbWlkOwoJd2hpbGUobGVmdDw9cmlnaHQpIHsKCQltaWQgPSBNYXRoLmZsb29yKChsZWZ0K3JpZ2h0KS8yKTsKCQlpZihhcnJbbWlkXSA+IHRhcmdldCkgewoJCQlyaWdodCA9IG1pZC0xOwoJCX0gZWxzZSBpZihhcnJbbWlkXSA8IHRhcmdldCkgewoJCQlsZWZ0ID0gbWlkKzE7CgkJfSBlbHNlIHsKCQkJcmV0dXJuIG1pZDsKCQl9Cgl9CglyZXR1cm4gLTE7Cn0KCmNvbnNvbGUubG9nKGJpbmFyeVNlYXJjaChbMiwgNCwgNSwgNywgOCwgOSwgMTFdLCA3LCAzKSk=