I have created an implementation of the BigInteger class, which has the option of using numbers input in any base.
I am having problems getting it to scale up for large numbers as I am first converting the input hexadecimal string, character by character into its binary equivalent string.
i.e. 0-0000,1-0001,2-0010 and so on.
This conversion is taking a lot of time because when I input a hex number of 600+ bits it has to match every option until the hex character macthes.
What would be an efficient way to perform this mapping? Is there any Java API or a data structure that I can use to make this process faster?
"A single conversation with a wise man is better than ten years of study."