Am 30.06.15 um 10:52 schrieb [email protected]:
It still bug out on very big numbers if base outside integer scope.
I am very keen on suggestions regarding the logic to make it faster.
Concerning the algorithmic complexity, it can't be faster than square
time in the number of digits N. Baseconversion needs to do a sequence of
division operations, where every operation gves you one digit in the new
base. The number of digits in the new base is proportional to the number
of digits in the old base (the ratio is log b1/log b2). Therefore it
will be O(N^2).
Christian
--
https://mail.python.org/mailman/listinfo/python-list
