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 vote208 views2 answers
C++ code
C
1 vote217 views3 answers
Strcpy c
C
0 vote178 views2 answers
Svg not loading in chrome
C
4 votes134 views1 answer
Rxjs npm
C
0 vote191 views1 answer
Remplir list Java rapidemnet
C
1 vote191 views3 answers
Prime number in c
C
0 vote194 views2 answers
Struct main function c in unix
C
4 votes275 views3 answers
Space x
C
0 vote214 views1 answer
How many archaeologists are there
C
1 vote210 views1 answer
Thread in c
C