Greatest common divisor: Difference between revisions

m
→‎Recursive Euclid algorithm: code simplification (Sidef)
m (Arendelle place fix...)
m (→‎Recursive Euclid algorithm: code simplification (Sidef))
Line 3,288:
 
<lang ruby>func gcd(a, b) {
b.isZerois_zero ?: (a.abs; : gcd(b, a % b));
}</lang>
 
2,747

edits