Greatest common divisor: Difference between revisions

Content added Content deleted
(Added Elixir)
m (→‎{{header|Oforth}}: Change of rem by mod)
Line 2,102:
 
Source of this method is (see Integer.of file) :
<lang Oforth>Integer method: gcd { self while ( dup 0 <> ) [ tuck remmod ] drop }</lang>
 
=={{header|Order}}==
Retrieved from "https://rosettacode.org/wiki/Greatest_common_divisor"