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

4 votes304 views2 answers
No module names skimage
C
0 vote292 views1 answer
Ecole de chien d'aveugles paris
C
0 vote305 views1 answer
Flake8 ignore line length
C
0 vote294 views1 answer
4k stogram chave
C
0 vote290 views1 answer
What is char in programming
C
0 vote304 views2 answers
String array input in c
C
0 vote256 views1 answer
Uri/beecrowd problem no - 1099 solution in C
C
0 vote288 views1 answer
Retoure a la ligne C
C
3 votes292 views1 answer
C printing char pointer
C
0 vote321 views1 answer
How to get out of function in c
C