Paul Zimmermann <Paul.Zimmermann at loria.fr> writes: I would use the largest allowed power of two, i.e., 32. Conversion is O(n) for a power-of-two base, against O(M(n) log n) for other bases. ... where M(n) is the time for a multiplication of n bits, which in turn is n log n log log n. -- Torbjörn