gcd recursion c++
int gcd(int a, int b){
if(b==0)
return a;
return gcd(b, a % b);
}gcd recursion c++
int gcd(int a, int b){
if(b==0)
return a;
return gcd(b, a % b);
}gcd c program recursion
Get Complete GCD code with all algorithms -
https://devsenv.com/codes/c-program-example-to-find-gcd-of-two-numbers-with-algorithmgcd of two numbers in c recursion
#include <stdio.h>
int hcf(int n1, int n2);
int main() {
int n1, n2;
printf("Enter two positive integers: ");
scanf("%d %d", &n1, &n2);
printf("G.C.D of %d and %d is %d.", n1, n2, hcf(n1, n2));
return 0;
}
int hcf(int n1, int n2) {
if (n2 != 0)
return hcf(n2, n1 % n2);
else
return n1;
}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
