[issue3451] Asymptotically faster divmod and str(long)

[Fredrik Johansson]

Fredrik Johansson <fredrik.johansson at gmail.com> added the comment:

And here some timings on my laptop.

Both int->str and balanced division become faster somewhere between 1000
and 2000 digits. This is after editing the division benchmark to use
random numbers instead of exact powers of ten (interestingly causing a
bit of slowdown). String conversion might be a little slower for lengths
that aren't close to powers of two.

Added file: http://bugs.python.org/file10991/div_timings.txt

_______________________________________
Python tracker <report at bugs.python.org>
<http://bugs.python.org/issue3451>
_______________________________________