The problem is to convert a string of binary digits to its decimal representation. Easy eh?
OK, it should be able to handle more than 64 bits in length and can convert it to any external libraries or data types without the use of large integers.
Do I do this?
So far I have a string called input that handles binary
Then I use input [0] etc. to get a letter representing that number I reach the points. / P>
Now I am tampering it and multiplying 2 by the same power, which indicates the index, and as much as I am going, the same is known through the stored array.
I do not work primitive type for a large integer large number.
My first solution works perfectly, how can I do this without using anything to store, i.e. only using strings to store stars.
Any thoughts?
Thanks
You will need an array of points to hold the result of a The array will be easy, but you can also use the final string. You can calculate the length of the input length, you may have to remove the leading zero in the end.
Calculate your result as before but add to the result array (including carrying).
I think this is a (homework) assignment that wants to implement your version of "Pen and Paper" additional method.
Comments
Post a Comment