Problem
Write a program in C to find the find the G.C.D of a number using recursion and display the result.
How to find the G.C.D of a number using recursion in C ?
#include <stdio.h>
int hcf(int n1, int n2);
int main()
{
int input1, input2;
printf("Abundantcode.com Coding samples\n");
printf("Enter the first number: ");
scanf("%d", &input1);
printf("Enter the second number: ");
scanf("%d", &input2);
printf("G.C.D of %d and %d is %d.", input1, input2, hcf(input1,input2));
return 0;
}
int hcf(int input1, int input2)
{
if (input2 != 0)
return hcf(input2, input1%input2);
else
return input1;
}Output
Abundantcode.com Coding samples
Enter the first number: 8
Enter the second number: 4
G.C.D of 8 and 4 is 4.
Leave a Reply