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 vote135 views1 answer
What keyword covers unhandled possibilities?
C
-1 vote244 views2 answers
C program
C
0 vote145 views2 answers
How to reset to read from beginning of file c
C
32 votes127 views7 answers
Add two numbers in c
C
2 votes100 views1 answer
Vscode arduino [Warning] Output path is not specified. Unable to reuse previously compiled files. Upload could be slow. See README.
C
0 vote146 views1 answer
MongoDb Read
C
0 vote132 views1 answer
Como somar em C
C
0 vote134 views1 answer
C refresher
C
0 vote138 views1 answer
Facetube
C
0 vote140 views1 answer
Program optimization
C