Greatest common divisor: Difference between revisions
m
sub-header changes for Sidef solutions
m (→Recursive Euclid algorithm: code simplification (Sidef)) |
m (sub-header changes for Sidef solutions) |
||
Line 3,279:
=={{header|Sidef}}==
▲== Built-in ==
<lang ruby>var arr = [100, 1_000, 10_000, 20];
say Math.gcd(arr...);</lang>
==
<lang ruby>func gcd(a, b) {
| |||