Greatest common divisor: Difference between revisions
Added Wren
No edit summary |
(Added Wren) |
||
Line 4,961:
Recursive
<lang wortel>&{gcd a b} ?{b !!gcd b %a b @abs a}</lang>
=={{header|Wren}}==
<lang ecmascript>var gcd = Fn.new { |x, y|
while (y != 0) {
var t = y
y = x % y
x = t
}
return x
}
System.print("gcd(33, 77) = %(gcd.call(33, 77))")
System.print("gcd(49865, 69811) = %(gcd.call(49865, 69811))")</lang>
{{out}}
<pre>
gcd(33, 77) = 11
gcd(49865, 69811) = 9973
</pre>
=={{header|x86 Assembly}}==
| |||