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 vote318 views1 answer
C first digit of integer
C
-1 vote320 views1 answer
What is implicit typecasting
C
0 vote403 views2 answers
Create role in psql with password
C
2 votes325 views1 answer
Cmd command with c
C
0 vote315 views7 answers
C code to MIPS assembly converter online
C
0 vote340 views1 answer
Extended euclidean algorithm to find x and y
C
0 vote315 views1 answer
Sbatch array set max jobs at once
C
7 votes333 views1 answer
Write a program to find reverse of given number
C
0 vote340 views2 answers
Vim vertical line at 80 characters
C
-1 vote327 views2 answers
C program
C