Anonymous user
Greatest common divisor: Difference between revisions
Added solution in J.
m (→Iterative: Cleaned up extra stuff) |
(Added solution in J.) |
||
Line 27:
: gcd ( a b -- n )
begin dup while tuck mod repeat drop ;
=={{header|J}}==
x+.y
=={{header|Java}}==
| |||