Here is what I did. Used For loop to iterate through all elements., then find binary by recursion and return
var temp3 = [57,80,95];
var temp2 = [];
var temp4 = '';
var r;
for(i=0;i<temp3.length;i++) {
var r = temp3[i];
temp2.push(binary(r));
}
function binary(r) {
console.log(r);
if (r === 0) return r;
temp3 = (r % 2) + temp3;
binary(Math.floor(r / 2));
return temp3;
}
//1100010
console.log(temp2);
You can use bitwise operators and recursion to easily convert a number to binary -
const binary = x =>
x < 2
? String(x)
: binary(x >> 1) + String(x & 1)
console.log(binary(57)) // 111001
console.log(binary(58)) // 111010
console.log(binary(80)) // 1010000
console.log(binary(95)) // 1011111
console.log(binary(1234567)) // 100101101011010000111
console.log(binary(12345678)) // 101111000110000101001110If you want the result as a number instead of a string, we can do that too. This second technique has limitations though because JavaScript's numbers quickly overflow -
const binary = n =>
n == 0
? 0
: 10 * binary (n >> 1) + (n & 1)
console.log(binary(57)) // 111001
console.log(binary(58)) // 111010
console.log(binary(80)) // 1010000
console.log(binary(95)) // 1011111
console.log(binary(1234567)) // 100101101011010000000 <- wrong
console.log(binary(12345678)) // 1.0111100011000008e+23 <- imprecise
const binary = (n) => n == 0 ? 0 : 10 * binary (n >> 1) + (n & 1)
The correct way to write the binary function would be this -
function binary(r, i = 0) {
console.log(r);
if (r === 0) return r;
return (r % 2) * Math.pow(10, i) + binary(Math.floor(r / 2), i + 1);
}
Although, there are many ways to convert an int to binary, I feel this is one of the easiest ones. And, If you want further explanation or clarity please comment down below.
binary(r, 0) and the other thing is Math.pow(10, i) which actually raises 10 to the power of i. So you can actually remove both of these things but you would need to add further unnecessary code.
binarydoing?temp3from the original array to a number. Also, there's no recursion. edit oh wait yes there is