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 vote431 views1 answer
Entering raw mode
C
1 vote388 views1 answer
Char array to int c
C
1 vote381 views1 answer
Get_session` is not available when using TensorFlow 2.0.
C
0 vote392 views2 answers
Use frama c online
C
17 votes435 views2 answers
Write in file in c
C
3 votes399 views1 answer
Initialize array in c with 0
C
1 vote439 views1 answer
How to checkout branch from commit id
C
0 vote378 views1 answer
How to link flexslider
C
0 vote366 views1 answer
Aws solution architect vs developer associate
C
0 vote370 views1 answer
Problem Statement Print the following output: \ Input Format IN Output Format \
C