// 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, 6, 7], 5, 5));
Ly8geW91ciBjb2RlIGdvZXMgaGVyZQoKZnVuY3Rpb24gYmluYXJ5U2VhcmNoKGFyciwgbiwgdGFyZ2V0KSB7CglsZXQgbGVmdD0wLCByaWdodD1uLTEsIG1pZDsKCQoJd2hpbGUobGVmdDw9cmlnaHQpIHsKCQltaWQgPSBNYXRoLmZsb29yKChsZWZ0K3JpZ2h0KS8yKTsKCQlpZihhcnJbbWlkXT50YXJnZXQpIHsKCQkJcmlnaHQgPSBtaWQtMTsKCQl9IGVsc2UgaWYoYXJyW21pZF0gPCB0YXJnZXQpIHsKCQkJbGVmdCA9IG1pZCsxOwoJCX0gZWxzZSB7CgkJCXJldHVybiBtaWQ7CgkJfQoJfQoJcmV0dXJuIC0xOwp9Cgpjb25zb2xlLmxvZyhiaW5hcnlTZWFyY2goWzIsIDQsIDUsIDYsIDddLCA1LCA1KSk7