A more complicated program is presented and analyzed in this section, a program with a while loop. It is actually the good old familiar Euclid algorithm for finding the greatest common divisor (GCD) of two whole numbers.