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 vote235 views1 answer
Malloc contiguous 2d array
C
0 vote189 views5 answers
Helloworld c
C
2 votes214 views2 answers
Debian apt force overwrite
C
11 votes320 views5 answers
Char to int in c
C
1 vote207 views2 answers
Slack wordpress
C
0 vote214 views2 answers
C %d
C
0 vote247 views1 answer
Downgrade chrome to previous stable version in linux
C
4 votes203 views3 answers
Fibbonacci series
C
0 vote235 views1 answer
Wireshark tls client hello filter
C
2 votes228 views2 answers
'django.contrib.auth.views' has no attribute 'logout'
C