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 vote282 views1 answer
Add quantity and add to cart woo
C
7 votes282 views2 answers
Install c compiler ubuntu
C
3 votes325 views2 answers
Fread
C
12 votes358 views5 answers
C char to int
C
-1 vote343 views2 answers
C program
C
0 vote354 views1 answer
Divide a linked list into three parts based on their position mod 3.
C
7 votes333 views3 answers
C type conversion
C
0 vote346 views1 answer
Meaning of &variable c
C
4 votes332 views2 answers
Maximo comun divisor
C
2 votes305 views2 answers
Prototype pollution
C