01-05-2016, 03:42 PM

Hello there, not sure where to post this but whatever.

For a user input I'd like to convert from BCD to binary. Now obviously I could multiply the number in the 100's place by 100 and add it to the number in the 10's place multipleid by 10 and then add that to the number in the 1's place, but I'd like to know if it would be more efficient to reverse the double dabble algorithm. Is this even possible? If so, what would be the defenition of the reverse double dabble algorithm?

Thanks!

-David

For a user input I'd like to convert from BCD to binary. Now obviously I could multiply the number in the 100's place by 100 and add it to the number in the 10's place multipleid by 10 and then add that to the number in the 1's place, but I'd like to know if it would be more efficient to reverse the double dabble algorithm. Is this even possible? If so, what would be the defenition of the reverse double dabble algorithm?

Thanks!

-David