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

29 votes194 views1 answer
Best sites for coding challenges
C
0 vote115 views1 answer
Fine print serial key
C
3 votes120 views1 answer
Union in C
C
3 votes130 views3 answers
Mp3 to ogg
C
-1 vote229 views2 answers
C program
C
-1 vote114 views1 answer
Remove last entry from array in Javascript
C
2 votes104 views2 answers
Linux directory commands
C
2 votes131 views5 answers
Pointer in C
C
0 vote119 views1 answer
Form controls in bootsrap
C
0 vote120 views1 answer
Sbatch array set max jobs at once
C