Mark Dickinson added the comment: Replacing lehmer_gcd.py with a revised version. Even in Python, this version is faster than the current one, on my machine, once both numbers are greater than 10**650 or so (your crossover points may vary). It's over four times faster for very large inputs (over 10**20000).
> In any case, before going any further, you should design a benchmark > and defend it. Okay. I'll stop now :) Added file: http://bugs.python.org/file9464/lehmer_gcd.py __________________________________ Tracker <[EMAIL PROTECTED]> <http://bugs.python.org/issue1682> __________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
