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 vote281 views2 answers
Cannot convert from 'int' to 'string' [Api]
C
0 vote232 views6 answers
Inorder to postorder converter online
C
0 vote284 views1 answer
Hostbuilder add environment variables
C
0 vote259 views1 answer
1000000000
C
0 vote233 views1 answer
4k stogram chave
C
0 vote258 views1 answer
Extended euclidean algorithm to find x and y
C
7 votes255 views1 answer
Invalid operands to binary expression ('int *' and 'int *')
C
0 vote250 views1 answer
Wordpress clean name spaces
C
0 vote253 views2 answers
Remove \n from string c
C
0 vote214 views1 answer
Pebble scripting Boolean expression
C