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 vote250 views1 answer
Table de hachage en c
C
0 vote236 views1 answer
XAudio2 C
C
0 vote253 views1 answer
Increment & Decrement Operator in C language
C
25 votes253 views10 answers
Bootstrap
C
1 vote295 views1 answer
C colour
C
0 vote230 views1 answer
Tuples in C
C
0 vote251 views1 answer
Quick look pluigns for macs
C
2 votes246 views1 answer
Can we write a program without main in c
C
1 vote297 views1 answer
Length of string in c
C
0 vote255 views1 answer
<img src="https://www.google.com/url?sa=i&url=https%3A%2F%2Ftwitter.com%2Fimgatennis%3Flang%3Dar-x-fm&psig=AOvVaw1QH9um9Q1ktPXKUufXt8Av&ust=1636491440205000&source=images&cd=vfe&ved=0CAsQjRxqFwoTCKi9v-rTifQCFQAAAAAdAAA
C