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 vote353 views1 answer
Passing an array to a function
C
0 vote362 views1 answer
Counting Sort C
C
0 vote358 views1 answer
How to allacare array 2d in c
C
16 votes414 views6 answers
Golang map
C
33 votes485 views10 answers
Chat
C
1 vote362 views3 answers
Prime number in c
C
0 vote355 views1 answer
C zero out array
C
4 votes378 views1 answer
Typedef c struct
C
1 vote375 views1 answer
Keyboard shortcut for opening a file in mac
C
0 vote366 views1 answer
Libdvd-pkg: `apt-get check` failed
C