Greatest common divisor: Difference between revisions

Content added Content deleted
(Added Frink.)
Line 627: Line 627:


<tt>gcd_bin(40902, 24140)</tt> takes us about '''2.5''' µsec
<tt>gcd_bin(40902, 24140)</tt> takes us about '''2.5''' µsec

=={{header|Frink}}==
Frink has a builtin <CODE>gcd[x,y]</CODE> function that returns the GCD of two integers (which can be arbitrarily large.)
<lang frink>
println[gcd[12345,98765]]
</lang>


=={{header|Genyris}}==
=={{header|Genyris}}==