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 vote429 views1 answer
C read csv
C
0 vote399 views1 answer
How to fill a triangle in c
C
0 vote403 views1 answer
Fclose C
C
-3 votes386 views2 answers
How to return a char array from a function in C
C
0 vote384 views1 answer
Uri/beecrowd problem no - 1131 solution in C
C
7 votes446 views5 answers
Sleep function in c
C
0 vote397 views1 answer
Xor in c
C
0 vote413 views1 answer
C program to check whether character is lowercase or not using ASCII values
C
0 vote412 views1 answer
Sbatch array set max jobs at once
C
4 votes384 views3 answers
C program to print the multiplication table
C