[seqfan] Re: Base conversion question

[franktaw at netscape.net]

The straightforward algorithm -- repeated division by the new base -- 
is O(n^2).  (Here n is not the number being converted, but its size, 
which is to say its log.)

I don't know of any better algorithm.  Nor, really, of any other 
algorithm.

Franklin T. Adams-Watters


-----Original Message-----
From: David Wilson <dwilson at gambitcomm.com>

I suppose this question is better addressed to math-fun, however, I do
not think my work self belongs to math-fun.

At any rate, does anyone know anything about the efficiency of base
conversion between non-homomorphic bases, e.g., 2 and 10?