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

18 votes138 views6 answers
Sql delete query
C
1 vote134 views2 answers
Node.js
C
0 vote141 views2 answers
Fgets remove newline
C
0 vote137 views2 answers
Svg not loading in chrome
C
0 vote153 views1 answer
Function for quicksort in c
C
11 votes143 views6 answers
Tailwindcss install
C
0 vote137 views1 answer
Graphics in C Draw Circle
C
1 vote138 views1 answer
Printf fill with 0
C
0 vote180 views1 answer
Limit axis in one direction plt
C
7 votes126 views3 answers
C type conversion
C