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 vote336 views1 answer
Rust named tuple
Rust
0 vote343 views2 answers
Rustlang char array
Rust
0 vote364 views1 answer
Rust bevy states
Rust
0 vote313 views1 answer
Rust match wildcard
Rust
0 vote389 views1 answer
Encode base64 rust
Rust
0 vote333 views1 answer
Rust program name
Rust
0 vote345 views1 answer
Rust sort vec of f64
Rust
0 vote315 views1 answer
Rust Pause execution for several seconds
Rust
0 vote415 views1 answer
Minimum and maximum numbers for various integer types
Rust
3 votes376 views2 answers
Allow dead code rust
Rust