Question

Must be written in C.

Complete the implementation of the gcd function using recursion:

int gcd(int a, int b);

the function computes the greatest common divisor.

The greatest common divisor represents the largest common divisor between two numbers. For example, the greatest common divisor between 28 and 63 is 7, because 7*4=28, and 7*9=63, and 28 and 63 share no common larger divisor.

Must use recursion in your solution. Need to handle negative inputs appropriately. For example, the gcd of -6 and 30 is 6, not -6.

Sample Output:

Enter a: 36
Enter b: 27
The gcd of 36 and 27 is 9

Answer 1

#include<stdio.h>

int gcd(int A, int B){
    if (B!= 0)
       return gcd(B, A%B);
    else 
       return A;
}

int main(){    
   int m,n, res;
   printf("Enter a: ");
   scanf("%d",&m);
   printf("Enter b: ");
   scanf("%d",&n);
   
   res = gcd(m,n);
   if(res < 0){
      res = res * -1;
   }
   
   printf("The gcd of %d and %d is %d\n",m,n,gcd(m,n));
   return 0;
}