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