Anonymous user
Greatest common divisor: Difference between revisions
Nimrod -> Nim
(Nimrod -> Nim) |
|||
Line 1,882:
=3</lang>
=={{header|
Ported from Pascal example
===Recursive Euclid algorithm===
<lang
if u %% v != 0:
result = gcd_recursive(v, u %% v)
Line 1,891:
result = v</lang>
===Iterative Euclid algorithm===
<lang
var t: int64 = 0
var u = u1
Line 1,901:
result = abs(u)</lang>
===Iterative binary algorithm===
<lang
var t, k: int64
var u = u1
| |||