Created
June 15, 2011 17:52
-
-
Save kopiro/1027658 to your computer and use it in GitHub Desktop.
Convert any number from base X to base X in Javascript
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function base_converter(nbasefrom, basefrom, baseto) { | |
var SYMBOLS = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; | |
if (basefrom<=0 || basefrom>SYMBOLS.length || baseto<=0 || baseto>SYMBOLS.length) { | |
console.log("Base unallowed"); | |
return null; | |
} | |
var i, nbaseten=0; | |
if (basefrom!=10) { | |
var sizenbasefrom = nbasefrom.length; | |
for (i=0; i<sizenbasefrom; i++) { | |
var mul, mul_ok=-1; | |
for (mul=0; mul<SYMBOLS.length; mul++) { | |
if (nbasefrom[i]==SYMBOLS[mul]) { | |
mul_ok = 1; | |
break; | |
} | |
} | |
if (mul>=basefrom) { | |
console.log("Symbol unallowed in basefrom"); | |
return null; | |
} | |
if (mul_ok==-1) { | |
console.log("Symbol not found"); | |
return null; | |
} | |
var exp = (sizenbasefrom-i-1); | |
if (exp==0) nbaseten += mul; | |
else nbaseten += mul*Math.pow(basefrom, exp); | |
} | |
} else nbaseten = parseInt(nbasefrom); | |
if (baseto!=10) { | |
var nbaseto = []; | |
while (nbaseten>0) { | |
var mod = nbaseten%baseto; | |
if (mod<0 || mod>=SYMBOLS.length) { | |
console.log("Out of bounds error"); | |
return null; | |
} | |
nbaseto.push(SYMBOLS[mod]); | |
nbaseten = parseInt(nbaseten/baseto); | |
} | |
return nbaseto.reverse().toString().replace(/,/g, ''); | |
} else { | |
return nbaseten.toString(); | |
} | |
return "0"; | |
} |
@apanasara, did you ever make a solution for bigger strings?
Here's my solution that does not have the length limitations:
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
less precision for big integers due to limitation of parseInt