GCD of two numbers using Recursion

/* Program : GCD using Recursion
by S.V.Koratkar
*/

#include<stdio.h>
#include<conio.h>

int gcd(int a,int b);//function declaration

void main()
{
int a,b,c;
clrscr();
//accept two numbers from user
printf("\n Enter two Numbers : ");
scanf("%d%d",&a,&b);

printf("\n Greatest Common Divisor(G. C. D.) of %d and %d is= %d",a,b,gcd(a,b));//function call

getch();
}

int gcd(int a, int b)//function definition
{
if(b!=0)
return gcd(b,a%b);

else
return a;
}

/*
----------------------OUTPUT--------------------------

 Enter two Numbers : 25 30

 Greatest Common Divisor(G. C. D.) of 25 and 30 is= 5

*/