Anonymous user
Greatest common divisor: Difference between revisions
Logo, Euclidian algorithm
(Logo, Euclidian algorithm) |
|||
Line 222:
return gcd(a, b % a);
}
=={{header|Logo}}==
to gcd :a :b
if :b = 0 [output :a]
output gcd :b modulo :a :b
end
=={{header|OCaml}}==
| |||