Stefan Behnel added the comment:
> it might be worth at least considering how a 'one or more parameter' gcd
> compares on performance grounds with a two parameter one.
There shouldn't be a difference in practice. The bulk of the work is in the
algorithm that finds the GCD of two numbers, and finding the GCD of multiple
numbers is simply
functools.reduce(math.gcd, seq_of_numbers)
Since the most common use case is finding the GCD of two numbers, I don't see a
reason to burden the implementation with a special case here.
----------
_______________________________________
Python tracker <rep...@bugs.python.org>
<http://bugs.python.org/issue22477>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe:
https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
