[issue3451] Asymptotically faster divmod and str(long)
Mark Dickinson
report at bugs.python.org
Mon Aug 4 17:51:57 CEST 2008
Mark Dickinson <dickinsm at gmail.com> added the comment:
There's also the recursive division algorithm due
to Burnikel and Ziegler; this might be worth a look.
I think it's the same asymptotic complexity (constant
times karatsuba multiplication complexity), but may
turn out to be faster for one reason or another.
I had a Python implementation of this somewhere;
I'll see if I can dig it out.
Assigning this to me so that it doesn't get lost or
forgotten; but note that I don't intend to do
anything about it before 2.6/3.0 final. If anyone else
wants to take it off my hands before then, feel free.
----------
assignee: -> marketdickinson
priority: -> normal
type: -> performance
versions: +Python 2.7, Python 3.1
_______________________________________
Python tracker <report at bugs.python.org>
<http://bugs.python.org/issue3451>
_______________________________________
More information about the Python-bugs-list
mailing list