Question

Using recursion find g.c.d(22,8)

Answer 1

Step-by-step explanation:

GCD of Two Numbers using 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;

}

output

Enter two positive integers: 22

8

G.C.D of 22 and 8 is 2.