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

3 votes445 views1 answer
How to compareTo in java
C
6 votes368 views1 answer
What is strikethrough in markdown
C
0 vote398 views1 answer
Function inside struct c
C
0 vote398 views10 answers
Php
C
1 vote412 views2 answers
_CRT_SECURE_NO_WARNINGS
C
0 vote407 views1 answer
Calculate the area of a circle and modify the same program to calculate the volume of a cylinder given its radius and height.
C
4 votes412 views1 answer
C double specifier
C
0 vote394 views1 answer
Suma de digitos
C
0 vote377 views1 answer
Latex remove page number from footer
C
0 vote376 views1 answer
Scan numbers into array c
C