Greatest common divisor: Difference between revisions

→‎{{header|AutoHotkey}}: Changed non-recursive version (slightly faster)
(→‎{{header|AutoHotkey}}: Changed non-recursive version (slightly faster))
Line 240:
Return b=0 ? Abs(a) : Gcd(b,mod(a,b))
}</lang>
Significantly faster than the recursive version aboverecursion:
<lang AutoHotkey>gcdGCD(a, b) {
while b
t := b, b := Mod(a, b)| 0x0, a := tb)
return, a
}</lang>
 
266

edits