This project computes the greatest common factor between two integers using the Euclidean algorithm. It’s a tutorial on using and swapping variables in a project. The algorithm uses the mod operator to find the remainder when one integer is divided by another integer. This is the core of the algorithm. To see how the algorithm works, use paper and pencil to divide 82 by 24. Doing so, you will find the quotient is 3 and the remainder is 10. The quotient is not important to the algorithm so discard it. Now, the remainder becomes the new divisor and the divisor becomes the new dividend. Keep dividing and swapping remainders, dividends, and divisors until the remainder is zero. That divisor is the greatest common factor GCF).
