Anonymous user
Greatest common divisor: Difference between revisions
→{{header|Rust}}
(→{{header|OCaml}}: idiomatic version) |
|||
Line 2,828:
=={{header|Rust}}==
===
<lang Rust>
use num::integer::gcd;</lang>
===Iterative Euclid algorithm===
<lang Rust>fn gcd(mut m:
while m != 0 {
let
m = n %
n =
}
n.abs()
Line 2,842 ⟶ 2,843:
===Recursive Euclid algorithm===
<lang Rust>fn gcd(m:
if m == 0 {
} else {
}
}</lang>
| |||