Added a new algorithm for brainfuckifiyng strings. This algorithms builds the string in memory setting bit by bit for every character by adding powers of two. It tries all (~64) the combinations of powers of two to use. Using only some has the advantage that it has to iterate through the string (which is very costly) fewer times. The number of characters for the brainfuck code is in O(n), where n is the length of the string. The output is often shorter than the one from the original algorithm for long-ish strings.
Added a new algorithm for brainfuckifiyng strings.
This algorithms builds the string in memory setting bit by bit for every character by adding powers of two.
It tries all (~64) the combinations of powers of two to use.
Using only some has the advantage that it has to iterate through the string (which is very costly) fewer times.
The number of characters for the brainfuck code is in O(n), where n is the length of the string.
The output is often shorter than the one from the original algorithm for long-ish strings.

SnowyCoder/brainfuckify