Open stylewarning opened 1 year ago
A basic version has been implemented. It is asymptotically efficient (it's a divide and conquer algorithm), but it is far from state-of-the-art.
Moreover, it's not efficient with memory; it writes out characters to streams, where we'd be better served writing out an array of numbers that do not exceed $10^k$ where $k$ is the greatest number such that $10^k < 2^{64}$.
Going to downgrade this from HIGH-PRIORITY since an implementation of something exists.
Implement to-decimal base conversion using a sub-quadratic algorithm.