Re:A little thing to love about Perl 6 and COBOL
by Sniffnoy on Thursday February 05, 2015 @05:00AM
(#9002463)
And -- to be totally explicit -- although the naïve way of finding GCD is based on factoring, in fact finding GCD can be done very quickly with Euclid's algorithm, without any need for factoring.
[ Parent
| on HN ]
There are no comments on this comment yet.