The Euclidean algorithm for computing the GCD of two integers is as follows: 1. If a = 0, then gcd(a,b) = b. 2. If b = 0, then gcd(a,b) = a. 3. Let r be the remainder of a divided by b. Then gcd(a,b) = gcd(b,r). This process is repeated until the remainder r is equal to zero. The last nonzero remainder is the GCD of the two integers.

The Euclidean algorithm for computing the GCD of two integers is as follows: 1. If a = 0, then gcd(a,b) = b. 2. If b = 0, then gcd(a,b) = a. 3. Let r be the remainder of a divided by b. Then gcd(a,b) = gcd(b,r). This process is repeated until the remainder r is equal to zero. The last nonzero remainder is the GCD of the two integers.