Anonymous user
Greatest common divisor: Difference between revisions
m
→{{header|M2000 Interpreter}}
No edit summary |
|||
Line 1,961:
gcd=lambda (u as long, v as long) -> {
=if(v=0&->abs(u), lambda(v, u mod v))
}
gcd_Iterative= lambda (m as long, n as long) -> {
while m {
let old_m = m
m = n mod m
n = old_m
}
=abs(n)
}
Module CheckGCD (f){
Line 1,968 ⟶ 1,976:
}
CheckGCD gcd
CheckGCD gcd_Iterative
</lang>
| |||