Write a program to find GCD of given number by using Recursion..

#include

int recgcd(int x, int y)
{
int r;
if(y==0)
{
return(x);
}
else
{
r=x%y;
return(recgcd(y,r));
}
}
main()
{
int a,b,gcd;
printf("Enter two numbers:");
scanf("%d%d",&a,&b);
gcd=recgcd(a,b);
printf("GCD of %d and %d is = %d\n",a,b,gcd);
}

******************OR***************************************

#include
int gcd(n1,n2)
{
int x;
int limit=n1>n2?n1:n2;
int small=n1
if(limit%small==0) return small;
x=limit%small;
gcd(limit,x);


}
main()
{
int n1,n2;
printf("Enter any two +ve numbers:");
scanf("%d%d",&n1,&n2);

gcd(n1,n2);
printf("%d\n",gcd(n1,n2));
}