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

481 votes338 views10 answers
December global holidays
C
4 votes253 views3 answers
Space x
C
0 vote284 views4 answers
Bootstrap carousel stop autoplay
C
4 votes265 views3 answers
Fibbonacci series
C
0 vote302 views5 answers
Online c compiler with mpi
C
1 vote268 views1 answer
Docker container give usb access
C
0 vote259 views1 answer
Networkx remove attributes
C
30 votes313 views2 answers
Online c compiler
C
0 vote257 views1 answer
How to print logs when doing unit-testing in rust
C
1 vote253 views1 answer
Divide and conquer program in c
C