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 vote287 views1 answer
Rust get items in a list with index and value
Rust
1 vote342 views1 answer
Get random enum rust
Rust
0 vote301 views1 answer
Rust filtering a vector example
Rust
0 vote310 views1 answer
Rust swap two values
Rust
0 vote304 views1 answer
Execution duration
Rust
5 votes369 views3 answers
Rust empty vector
Rust
0 vote283 views1 answer
Rust loop n times
Rust
0 vote301 views1 answer
How to make a sorting algorithim rust
Rust
1 vote325 views1 answer
Append to file rust
Rust
0 vote297 views1 answer
Rust named tuple
Rust