Comments on: Algorithms in Python: Base Expansion http://blog.madpython.com/2010/07/10/algorithms-in-python-base-expansion/ Watch out.. he's angry Wed, 14 Dec 2011 02:03:24 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: Alexander Wallar http://blog.madpython.com/2010/07/10/algorithms-in-python-base-expansion/comment-page-1/#comment-170 Alexander Wallar Thu, 03 Nov 2011 01:48:14 +0000 http://blog.madpython.com/?p=111#comment-170 from math import * def baseExpansion(n,c,b): ....j = 0 ....base10 = sum([pow(c,len(n)-k-1)*n[k] for k in range(0,len(n))]) ....while floor(base10/pow(b,j)) != 0: j = j+1 .....return [floor(base10/pow(b,j-p)) % b for p in range(1,j+1)] This algorithm although it might be a bit longer, runs without bounds on integer bases. The input is a list and so is the output as to accommodate for larger bases. from math import *
def baseExpansion(n,c,b):
….j = 0
….base10 = sum([pow(c,len(n)-k-1)*n[k] for k in range(0,len(n))])
….while floor(base10/pow(b,j)) != 0: j = j+1
…..return [floor(base10/pow(b,j-p)) % b for p in range(1,j+1)]

This algorithm although it might be a bit longer, runs without bounds on integer bases. The input is a list and so is the output as to accommodate for larger bases.

]]>