// 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) {
return mid;
} else if(arr[mid]<target) {
left = mid+1;
} else if(arr[mid]>target) {
right = mid-1;
}
}
return -1;
}
console.log(binarySearch([2, 5, 7, 9, 11, 13], 6, 10))
Ly8geW91ciBjb2RlIGdvZXMgaGVyZQpmdW5jdGlvbiBiaW5hcnlTZWFyY2goYXJyLCBuLCB0YXJnZXQpIHsKCWxldCBsZWZ0PTAsIHJpZ2h0PW4tMSwgbWlkOwoJd2hpbGUobGVmdDw9cmlnaHQpIHsKCQltaWQgPSBNYXRoLmZsb29yKChsZWZ0K3JpZ2h0KS8yKTsKCQlpZihhcnJbbWlkXSA9PSB0YXJnZXQpIHsKCQkJcmV0dXJuIG1pZDsKCQl9IGVsc2UgaWYoYXJyW21pZF08dGFyZ2V0KSB7CgkJCWxlZnQgPSBtaWQrMTsKCQl9IGVsc2UgaWYoYXJyW21pZF0+dGFyZ2V0KSB7CgkJCXJpZ2h0ID0gbWlkLTE7CQkJCgkJfQoJfQoJcmV0dXJuIC0xOwp9Cgpjb25zb2xlLmxvZyhiaW5hcnlTZWFyY2goWzIsIDUsIDcsIDksIDExLCAxM10sIDYsIDEwKSk=