Write a C program to find the GCD of two numbers.

// Iterative algorithm
int gcd(int a, int b)
{
int temp;

while(b)
{
temp = a % b;
a = b;
b = temp;
}

return(a);
}

// Recursive algorithm
int gcd_recurse(int a, int b)
{
int temp;

temp = a % b;

if (temp == 0)
{
return(b);
}
else
{
return(gcd_recurse(b, temp));
}
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s