http://d.puremagic.com/issues/show_bug.cgi?id=7102


bearophile_h...@eml.cc changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
             Status|RESOLVED                    |REOPENED
         Resolution|INVALID                     |


--- Comment #3 from bearophile_h...@eml.cc 2012-04-06 05:11:00 PDT ---
Instead of opening a new enhancement request, I reopen this one, because the
request is essentially the same.

I suggest to add this bignum specialization to std.numeric.gcd (or add a GCD in
std.bigint, but I'd like to have a single function for both bigints and
built-in ints).

Even if this isn't the fastest multi-precision GCD algorithm of the world, it
seems better than not being able to compute GCD on bigints, and it looks short,
both the Python prototype and the C patch are not long.

http://en.wikipedia.org/wiki/Lehmer%27s_GCD_algorithm

http://bugs.python.org/issue1682

http://bugs.python.org/file9464/lehmer_gcd.py

http://bugs.python.org/file9486/lehmer_gcd.patch


See also Issue 4125

-- 
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
------- You are receiving this mail because: -------

Reply via email to