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 vote119 views1 answer
Rust sum and average of number list
Rust
0 vote141 views1 answer
Create thread in rust
Rust
0 vote138 views1 answer
Rust loop vector by size
Rust
0 vote121 views1 answer
Initializing array rust
Rust
0 vote131 views1 answer
Uuid from string rust
Rust
0 vote135 views1 answer
Rust match enum
Rust
1 vote127 views1 answer
Bevy bundles
Rust
0 vote121 views1 answer
Rust count occurrences of a substring
Rust
0 vote134 views1 answer
Convert i32 to usize rust
Rust
2 votes217 views1 answer
Rustlang string
Rust