# (str -> dynamic unsigned long*) process
1. function takes `const char* s` as parameter
2. subtract 48 from each character to get `const char* nums`
- although, it is still a `char` array, it now holds only numbers [0,9]
- I dynamically create this using `strlen(s)`
- now `nums` looks like this (but longer): `[8, 4, 3, 2, 9]`
3. continually "divide" `nums` by 2 and get the quotient/remainder in order to
correctly get the binary sequence
- a dynamic array, `const unsigned long* bigNum` will be used for this
- first, the `0`th index of `bigNum` will be filled up bit by bit;
afterwards, I will simply keep adding more `unsigned longs` dynamically to
`bigNum` and populating each bit.
- in order to figure out when each `unsigned long` is "full", I'll need to
check the size using `sizeof()` from `<cmath>`
- in order to populate each bit, simple boolean logic is required: `<<` to
shift the potential `1` left and `|` to incorporate the `1` into the
correct `unsigned long` in the correct bit
# question
* is this too complicated?
- I was having a hard time finding a simpler way