Put in a base then put in the value https://scratch.mit.edu/projects/196048287/ -- bin to dec original code - bsht Number To Binary: https://scratch.mit.edu/projects/543946803/ -- bsht smack a comment that i might ignore if you want me to add 26 more charecters which will make it annoying. im suprised only 8 blocks is what held it back from being only binary to EVERYTHING base 0 -- useless base 1 -- useless base 2 -- binary (0,1) base 3 -- trinary (0,1,2) base 4 -- quaternary (0,1,2,3) base 5 -- quinary (0,1,2,3,4,5) base 6 -- senary base 7 -- septenary base 8 -- octal base 9 -- nonary base 10 -- normal counting method, should return exactly base 11 -- YOU GET THE IDEA base 12 -- Duodecimal ... lazy base 16 -- hexadecimal (0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F) im not doing all 36 sorry spaces break it 1010_ _= space will give incorrect info
Version 1.0 first release 4 digits Version 1.1 5 digits Version 1.2 fixed bug Version 1.3 added 6 digits 1.4 (7) DIIIIIIIGGGGGGGEEEEEEETTTTTTTTTTTSSSSSSS it is instant but I wanted it to be slower 1.5 would have been the translators first byte *8 bits but the project was old at that point and i was older so i made it better and jumped up to 2.0 with infinite digits or version infinity if i still did the hard way 2.0 optimized old code i wrote in like 5th or 6th grade allows for the need to never update to add more digits basically, you can have infinite digits. but it won't be able to parse numbers that are way too big because scratch puts a cap on it 36.0 (3.0) - i added 2 variables and it now can do all of the bases. i limited it to 36 because i am only going to use english and numerical things in the lookup table. not many people have arabic keyboards if thats a thing :/ (i dont either) 36.1 may port to the original project so that i can get the project id lol 36.2 added an optimization and turned on the screen refresh thingy, i was looping through and adding all of the numbers after the processng was done when i could have just added them up during the process
