Greatest common divisor: Difference between revisions
Content added Content deleted
(Added Haskell example) |
|||
Line 131:
===Iterative Euclid algorithm===
subroutine gcd_iter(value, u, v)
Cf2py integer, intent(out) :: value
integer value, u, v, t
intrinsic abs, mod
Line 145:
===Iterative binary algorithm===
subroutine gcd_bin(value, u, v)
Cf2py integer, intent(out) :: value
integer value, u, v, k, t, abs, mod
intrinsic abs, mod
| |||