Revision as of 20:37, 3 September 2013 (view source) rosettacode>Pgonzalez No edit summary ← Older edit		Revision as of 13:46, 22 September 2013 (view source) Gregor (talk \| contribs) (→‎{{header\|Rust}}) Newer edit →
Line 2,388: =={{header\|Rust}}== <lang Rust>fn gcd(amut m: int,b mut n: int) -> int { // Use Euclid's algorithm ~~match b {~~ while m != 0 { ~~0 => return a,~~ let temp = m; ~~_ => return gcd(b,(a%b)),~~ m = n % temp; }▼ n = temp; } </lang>▼ ▲ } n } ▲} </lang> =={{header\|Sather}}==

Greatest common divisor: Difference between revisions

Greatest common divisor (view source)