Greatest common divisor iterative

fn gcd(mut m: i32, mut n: i32) -> i32 {
   while m != 0 {
       let old_m = m;
       m = n % m;
       n = old_m;
   }
   n.abs()
}

fn main() {
    println!("Greatest Common Divisor = {} ",gcd(115, 230));
}

Greatest common divisor iterative

#include<stdio.h>

int gcd_iter(int u, int v) {
  if (u < 0) u = -u;
  if (v < 0) v = -v;
  if (v) while ((u %= v) && (v %= u));
  return (u + v);
}

int main() {
    printf("Greatest Common Divisor = %i", gcd_iter(115, 230));
}

Similar codes

0 vote365 views1 answer
Rust elapsed time
Rust
3 votes467 views1 answer
Random number generator in rust
Rust
0 vote349 views1 answer
Rust how to make print happen before asking for input
Rust
0 vote354 views1 answer
Rust currying, preset some arguments
Rust
0 vote315 views1 answer
Rust number squared
Rust
0 vote359 views1 answer
Rust concurrent execution of f with parameter i. Tasks are independent and don't return any value.
Rust
2 votes514 views3 answers
Rust comment types
Rust
3 votes442 views1 answer
Rust get current directory
Rust
1 vote345 views1 answer
Rust remove element from vector
Rust
0 vote368 views1 answer
Rustlang how to compile
Rust