GCD Recursion c
int gcd(int a, int b){
if(b==0)
return a;
return gcd(b, a % b);
}
Comfortable Chipmunk
int gcd(int a, int b){
if(b==0)
return a;
return gcd(b, a % b);
}Get Complete GCD code with all algorithms -
https://devsenv.com/codes/c-program-example-to-find-gcd-of-two-numbers-with-algorithm