# All Your Base in C

#### Convert a number, represented as a sequence of digits in one base, to any other base.

1 | ```
exercism fetch c all-your-base
``` |

# All Your Base

Convert a number, represented as a sequence of digits in one base, to any other base.

Implement general base conversion. Given a number in base **a**,
represented as a sequence of digits, convert it to base **b**.

## Note

- Try to implement the conversion yourself. Do not use something else to perform the conversion for you.

## About Positional Notation

In positional notation, a number in base **b** can be understood as a linear
combination of powers of **b**.

The number 42, *in base 10*, means:

(4 * 10^{1)} + (2 * 10^{0)}

The number 101010, *in base 2*, means:

(1 * 2^{5)} + (0 * 2^{4)} + (1 * 2^{3)} + (0 * 2^{2)} + (1 * 2^{1)} + (0 * 2^{0)}

The number 1120, *in base 3*, means:

(1 * 3^{3)} + (1 * 3^{2)} + (2 * 3^{1)} + (0 * 3^{0)}

I think you got the idea!

*Yes. Those three numbers above are exactly the same. Congratulations!*

## Getting Started

Make sure you have read the C page on the Exercism site. This covers the basic information on setting up the development environment expected by the exercises.

## Passing the Tests

Get the first test compiling, linking and passing by following the three rules of test-driven development.

The included makefile can be used to create and run the tests using the `test`

task.

1 |
```
make test
``` |

Create just the functions you need to satisfy any compiler errors and get the test to fail. Then write just enough code to get the test to pass. Once you've done that, move onto the next test.

As you progress through the tests, take the time to refactor your implementation for readability and expressiveness and then go on to the next test.

Try to use standard C99 facilities in preference to writing your own low-level algorithms or facilities by hand.

## Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.