binaryserachindex javascript
function binarySearchIndex (array, target, low = 0, high = array.length - 1) {
if (low > high) {
return -1
}
const midPoint = Math.floor((low + high) / 2)
if (target < array[midPoint]) {
return binarySearchIndex(array, target, low, midPoint - 1)
} else if (target > array[midPoint]) {
return binarySearchIndex(array, target, midPoint + 1, high)
} else {
return midPoint
}
}how to convert to binary in javascript
function bin(num) {
var binn = [];
var c;
while (num != 1) {
c = Math.floor(num / 2);
binn.unshift(num % 2);
num = c;
}
binn.unshift(1)
return binn
}
//returns list of binary nos. in orderCopyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
