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 vote159 views1 answer
C fscanf ignore commas
C
0 vote174 views1 answer
Fgets em c
C
1 vote127 views1 answer
Type of instruction in c
C
0 vote161 views1 answer
Email dev Microsoft Outlook 2007 items all aligned left or aligned wrong
C
0 vote160 views1 answer
Balanced binary tree
C
0 vote222 views1 answer
C program to find minimum of 5 numbers using conditional operator in c
C
0 vote295 views1 answer
Largest value in u16
C
0 vote164 views2 answers
Es6 import all
C
7 votes172 views1 answer
Invalid operands to binary expression ('int *' and 'int *')
C
7 votes187 views3 answers
Take array as input in c
C