Greatest common divisor: Difference between revisions

Content added Content deleted
Line 1,295: Line 1,295:
else if a > b then gcd b (a mod b)
else if a > b then gcd b (a mod b)
else gcd a (b mod a)</lang>
else gcd a (b mod a)</lang>

=== Built-in ===
<lang ocaml>#load "nums.cma";;
open Big_int;;
let gcd a b =
int_of_big_int (gcd_big_int (big_int_of_int a) (big_int_of_int b))</lang>


=={{header|Octave}}==
=={{header|Octave}}==