Data Structures & Algorithms In Go/

...

/

Solution Review: Greatest Common Divisor

Solution Review: Greatest Common Divisor

Let’s take a detailed look at the previous challenge’s solution.

We'll cover the following...

Solution

There are many ways to find the GCD of two integers. We’ll use Euclid’s algorithm to calculate the GCD:

  • If n = 0 then GCD(n, m) = m. This is a termination condition.

  • If m = 0 then GCD(n, m) = n. This is a termination condition.

  • Write n in the form of a quotient remainder (n=mq+r)(n = mq + r) ...