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 vote190 views1 answer
Wpdb add temporary while drop table
C
0 vote197 views1 answer
Uri/beecrowd problem no - 1131 solution in C
C
4 votes207 views1 answer
How to print value of pointer in c
C
0 vote230 views1 answer
Function for quicksort in c
C
0 vote197 views1 answer
C read file content
C
12 votes293 views6 answers
Do-While loop
C
1 vote179 views1 answer
Directory folders structure show windows 10 command prompt
C
0 vote193 views1 answer
How to turn off bash
C
0 vote195 views1 answer
Android studio sdkmanager always accept
C
0 vote210 views1 answer
Android is not recognized
C