greatest common divisor recursion
/* Function using "Euclidian Algorithm" to recursively find the
greatest common divisor/factor (GCD/GCF) of 2 positive numbers*/
const gcf = function (small, large) {
let r = large % small;
if (r == 0)
return small;
else
return gcf(r, small);
}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));
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
