The Euclidean algorithm - The Euclidean algorithm provides a wonderful way to
calculate the greatest common factor of 2 numbers. The greatest common factor,
which is the largest number that divides evenly into 1 or more numbers, is useful
for reducing fractions. The Euclidean algorithm works by dividing 1 number by
the other and finding the remainder. The 2 numbers are redefined, and then the
process is repeated. The process ends when the remainder is equal to 0.
Following is the pseudo code for the algorithm. In c++ use 145 and 87 to test your
program. The program will find the largest common factor of the numbers (the
answer should be 29).