This is the original code.
def d_to_b(dec, bin="")
dec = dec.to_i
if (dec < 2)
bin += dec.to_s
bin = bin.reverse
return bin
else
a = dec%2
bin += a.to_s
d_to_b(dec/2, bin)
end
end
def b_to_d(bin)
bin = bin.to_s
a = (bin.length - 1)
dec = 0
i = 0
while(i <= a)
dec += (bin[i].to_i)*(2**(a-i))
i += 1
end
return dec
end
I want to improve the code. make it faster, and shorten it. Any help, perhaps a more efficient algorithm.