WRITE A RECURSIVE C FUNCTION TO CALCULATE THE GCD OF TWO NUMBERS. USE THIS FUNCTION IN MAIN

GCD CACULATED AS
  gcd(a,b) = a                   if b=0
                  =gcd(b, a mod b) otherwise

#include<stdio.h>
int gcd(int a,int b);
main()
{
int a,b,c;
printf("Enter two nos ");
scanf("%d%d",&a,&b);
c=gcd(a,b);
printf("%d",c);
}
int gcd(int a,int b)
{
int c;
if(b==0)
return a;
else
{
c=gcd(b,a%b);
return c;
}

}

ASSIGNMENT 8)

  TO DEMONSTRATE RECURSION