Question

C program to find gcd of two numbers using recursion

Answer 1

input:

#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;

}

Output:Enter two positive integers: 366

Enter two positive integers: 36660

Enter two positive integers: 36660G.C.D of 366 and 60 is 6.

Answer 2

Answer:

#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;

}

Explanation: