Den tisdag 30 juni 2015 kl. 11:08:01 UTC+2 skrev Christian Gollwitzer: > Am 30.06.15 um 10:52 schrieb jonas.thornv...@gmail.com: > > 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
There is not a single division "except for the 2 one, used in halfinterval search" This algorithm only use multiplication and a modified GCD search algorithm. http://jt.node365.se/baseconversion9.html -- https://mail.python.org/mailman/listinfo/python-list
