To find the hcf between two numbers using recursion function

In this program I have given the concept of finding the hcf between two numbers using function.
The highest common factor of integers x and y is the largest integer that evenly divides both x and y.
The main points to be remember while doing this program is:

If y is equal to 0, then hcf(x,y) is x,
otherwise
hcf(x,y) is hcf(y,x%y)
 The main source code of the program is given below:

	#include<stdio.h>
	#include<conio.h>
	int hcf(int,int);
	int main()
	{
	int a,b,gcd;
	printf("enter two numbers to calculate hcf");
	scanf("%d%d",&a,&b);
	gcd=hcf(a,b);
	printf("greatest common divisor ids %d",gcd);
	getch();
	}
	int hcf(int x,int y)
	{
	if (y!=0)
	return hcf(y,x%y);
	else
	return x;
	}

view raw To find hcf between two numbers using recursive function hosted with ❤ by GitHub