The greatest common divisor (GCD) of two integers $a$ and $b$ is defined to be the largest integer that divides both $a$ and $b$ with no remainder. For example, the GCD of 16 and 28 is 4. In chapter 2, when we investigate how to implement rationalnumber arithmetic, we will need to be able to compute GCDs in order to reduce rational numbers to lowest terms. (To reduce a rational number to lowest terms, we must divide both the numerator and the denominator by their GCD. For example, 16/28 reduces to 4/7.) One way to find the GCD of two integers is to factor them and search for common factors, but there is a famous algorithm that is much more efficient.
The idea of the algorithm is based on the observation that, if $r$ is the remainder when $a$ is divided by $b$, then the common divisors of $a$ and $b$ are precisely the same as the common divisors of $b$ and $r$. Thus, we can use the equation \[\begin{array}{lll} \textrm{GCD} (a, b) &=& \textrm{GCD}(b, r) \end{array}\] to successively reduce the problem of computing a GCD to the problem of computing the GCD of smaller and smaller pairs of integers. For example, \[\begin{array}{lll} \textrm{GCD}(206,40) & = & \textrm{GCD}(40,6) \\ & = & \textrm{GCD}(6,4) \\ & = & \textrm{GCD}(4,2) \\ & = & \textrm{GCD}(2,0) \\ & = & 2 \end{array}\] reduces $\textrm{GCD}(206, 40)$ to $\textrm{GCD}(2, 0)$, which is 2. It is possible to show that starting with any two positive integers and performing repeated reductions will always eventually produce a pair where the second number is 0. Then the GCD is the other number in the pair. This method for computing the GCD is known as Euclid's Algorithm.[1]
It is easy to express Euclid's Algorithm as a procedure: function:
Original  JavaScript 
(define (gcd a b) (if (= b 0) a (gcd b (remainder a b))))  function gcd(a, b) { return b === 0 ? a : gcd(b, a % b); } 
The fact that the number of steps required by Euclid's Algorithm has logarithmic growth bears an interesting relation to the Fibonacci numbers:
Lamé's Theorem: If Euclid's Algorithm requires $k$ steps to compute the GCD of some pair, then the smaller number in the pair must be greater than or equal to the $k$th Fibonacci number.[2]
We can use this theorem to get an orderofgrowth estimate for Euclid's Algorithm. Let $n$ be the smaller of the two inputs to the procedure. function. If the process takes $k$ steps, then we must have $n\geq {\textrm{Fib}} (k)\approx\phi^k/\sqrt{5}$. Therefore the number of steps $k$ grows as the logarithm (to the base $\phi$) of $n$. Hence, the order of growth is $\Theta(\log n)$.
Original  JavaScript  
