Please Help me with this one problem.

[alisbub]

The greatest common divisor of two positive integers is the largest integer that is a divisor of both of them. For example, 6 and 15 have 3 as their greatest common divisor, and 15 and 22 have 1 as their greatest common divisor. The following recursive function computes the greatest common divisor of two positive integers. First write a program to test the function; then write and test an equivalent iterative function.

int gcd(int a, int b)
{
int r;

if ((r = a % b) = = 0)
return b;
else
return gcd(b, r);
}

[Manjiri]

The greatest common divisor of two positive integers is the largest integer that is a divisor of both of them. For example, 6 and 15 have 3 as their greatest common divisor, and 15 and 22 have 1 as their greatest common divisor. The following recursive function computes the greatest common divisor of two positive integers. First write a program to test the function; then write and test an equivalent iterative function.

int gcd(int a, int b)
{
int r;

if ((r = a % b) = = 0)
return b;
else
return gcd(b, r);
}

Here i have the solution..
Is it required one...?
Plz reply back..

#include<stdio.h>
 
int main()
{
int a,b,n,gcdnum=0,i;
printf("enter two numbers\n");
scanf("%d%d",&a,&b);
n=(a<b)?a:b;
for(i=1; i<=a; i++)
{
if(a%i==0 && b%i==0)
{
if(gcdnum<i)
gcdnum=i;
else
gcdnum=gcdnum;
}
}
printf("Greatest common devisor is %d",gcdnum);
return 0;
}

[DeMan]

I don't mean to be horribly pedantic, but the else statement is unnecessary. gcdnum will stay gcdnum if we don't do anything, so include the {if then change} but you can safely omit the else

[alisbub]

Here i have the solution..
Is it required one...?
Plz reply back..

#include<stdio.h>
 
int main()
{
int a,b,n,gcdnum=0,i;
printf("enter two numbers\n");
scanf("%d%d",&a,&b);
n=(a<b)?a:b;
for(i=1; i<=a; i++)
{
if(a%i==0 && b%i==0)
{
if(gcdnum<i)
gcdnum=i;
else
gcdnum=gcdnum;
}
}
printf("Greatest common devisor is %d",gcdnum);
return 0;
}

That worked thanks for your help.