Base 10 to base n conversions

c++ algorithm base-conversion
Rontogiannis Aristofanis picture Rontogiannis Aristofanis · Oct 3, 2012 · Viewed 36.9k times · Source

I'm trying to write a C++ program that does base-conversions.

I want to convert a decimal number to all the other integer bases from 2 to 20.

Is there an efficient and easy-to-implement algorithm for base conversions?

Answer

penelope picture penelope · Oct 3, 2012

I don't understand where exactly is the problem? It's very easy and straigtforward to do base conversion: you do it as you would by hand.

  • divide the number by base
  • write down the remainder
  • repeat the process with the integer part of the division
  • stop when you reach zero
  • the remainders in reverse order give you the digits in base

Example:

1025 (decimal) to base 15:

1025 / 15 = 68 , remainder 5
68   / 15 =  4 , remainder 8
4    / 15 =  0 , remainder 4

The number in base 15 is 485

Related questions

How to replace all occurrences of a character in string?

What is the effective way to replace all occurrences of a character with another character in std::string?

Read More
What is the most effective way for float and double comparison?

What would be the most efficient way to compare two double or two float values? Simply doing this is not correct: bool CompareDoubles1 (double A, double B) { return A == B; } But something like: bool CompareDoubles2 (double A, double B) { diff = …

Read More
Printing prime numbers from 1 through 100

This c++ code prints out the following prime numbers: 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97. But I don't think that's the way my book wants it to be written. It mentions something about square root of a number. So I did try changing my 2nd loop …

Read More