Hi guys, its me again. Just dropped by to say that I've managed to somehow visualize how my program is going to work. I actually have made a pseudocode (if you could call it one, haha) to guide me through the whole programming process. My problem is that I ain't quite sure if it really makes sense or if it points me to the right track. So I thought it might be a good idea to post it here and let you guys browse through it...Please please do take a quick look at it and comment on it. I would really appreciate it. Thank you guys and God bless!
Outline for Base Converter Program
• Ask for input number; one place value at a time; range is from -268,435,455 to 268,435,455
• Ask for input base; range is from 2-16 only
• Ask for destination base; range is from 2-16 only
• An int variable is reserved for the input base, the destination base, as well as for each of the place values given; an int variable should also be assigned for each of the products in the proceeding step
• Each place value is multiplied with the base (w/c is raised to n; being dependent on the place value)
• The products from the preceding step (being already assigned to a variable) would now be used to convert from the present base (w/c is base 10) to the desired base of the user
• To do this, all the variables containing the products must first be assembled according to their place values (w/c I have no idea how to do it!)
• After doing so, the emerging number would then be divided continuously by the destination base, with each of the quotients assigned to another variable until a 1 or a 0 emerge as a divisor.
• If 1 remains, display 1 then followed by all the other quotients from the most recent to the first one to emerge
• If 0 remains, display answer starting from the most recent quotient up to the first one
• End the program
~~~Damn it ain't fun being a newbie!!! ^_^
)
