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 vote400 views1 answer
Pasar a binario recursivo
C
1 vote368 views1 answer
Is 33 prime number
C
0 vote356 views1 answer
Cmd command to hide folder
C
2 votes392 views1 answer
%.*s in c
C
8 votes415 views2 answers
Millis()
C
0 vote383 views1 answer
Objects in oops
C
0 vote356 views1 answer
How to read space separated words in c
C
0 vote407 views1 answer
Vbl share price
C
0 vote431 views3 answers
Install postgres on linux
C
0 vote360 views1 answer
Wpdb add temporary while drop table
C