On Fri, Jul 30, 2010 at 11:47 AM, David Hutto <smokefl...@gmail.com> wrote:
> This is basically to get feedback, on a better way to show the
> greatest common divisor in fraction, in order to reduce it fully, than
> the one I've come up with. I'm sure there are better ways, so if you
> have simpler method, or critique of what I've done, let me know.
[snip]
I have a far simpler solution:
>>> from tools import gcd
>>> gcd(20, 5)
5
>>>
def gcd(a, b):
while b != 0:
(a, b) = (b, a%b)
return a
cheers
James
--
-- James Mills
--
-- "Problems are solved by method"
_______________________________________________
Tutor maillist - Tutor@python.org
To unsubscribe or change subscription options:
http://mail.python.org/mailman/listinfo/tutor
