Question

Problem 1: Euclid's algorithm (or the Euclidean algorithm) is an algorithm that computes the greatest common divisor, denoted by gcd, of two integers. Below are the original versions of Euclid's algorithm that uses repeated subtraction and another one that uses the remainder. int gcd_sub(int a, int b) int gcd_rem(int a, int b) { { if (!a) int t; return b; while (b) while (b) { if (a > b) a = a - b; else b = b - a; return a; } t = b; b = a % b; a = t; } return a; } 1. Trace each of the above algorithm using specific values for a and b. 2. Compare both algorithms.

          Problem 1: Euclid's algorithm (or the Euclidean algorithm) is an algorithm that computes the
greatest common divisor, denoted by gcd, of two integers. Below are the original versions of
Euclid's algorithm that uses repeated subtraction and another one that uses the remainder.
int gcd_sub(int a, int b)
int gcd_rem(int a, int b)
{
{
if (!a)
int t;
return b;
while (b)
while (b)
{
if (a > b)
a = a - b;
else
b = b - a;
return a;
}
t = b;
b = a % b;
a = t;
}
return a;
}
1. Trace each of the above algorithm using specific values for a and b.
2. Compare both algorithms.

Problem 1: Euclid's algorithm (or the Euclidean algorithm) is an algorithm that computes the
greatest common divisor, denoted by gcd, of two integers. Below are the original versions of
Euclid's algorithm that uses repeated subtraction and another one that uses the remainder.
int gcdsub(int a, int b)
int gcdrem(int a, int b)

if (!a)
int t;
return b;
while (b)
while (b)

if (a > b)
a = a - b;
else
b = b - a;
return a;

t = b;
b = a % b;
a = t;

return a;

1. Trace each of the above algorithm using specific values for a and b.
2. Compare both algorithms.

Added by Alfonso D.

Question

Please give Ace some feedback