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

1 vote205 views1 answer
Round function in C
C
0 vote200 views2 answers
Struct main function c in unix
C
45 votes341 views3 answers
String concatenation in c
C
0 vote229 views2 answers
Bcopy
C
0 vote197 views2 answers
Obstacle avoiding robot in c++ program
C
1 vote183 views2 answers
Strstr
C
0 vote193 views1 answer
Fscanf stops at space
C
0 vote223 views1 answer
'keras.backend' is not a package
C
0 vote195 views1 answer
Program optimization
C
0 vote155 views2 answers
Db browser for sqlite ubuntu 20.04
C