Euclidean Algorithm Using Subtraction Only

Explanations of the Euclidean Algorithm for finding the greatest common divisor of two integers often seem long and convoluted. The idea is, in fact, beautifully simple. All it is is a process of repeat subtraction, carrying the result forward each time until the result is equal to the amount being subtracted. If the answer is greater than 1, there is a GCD (besides 1). If the answer is 1, there is no common divisor (besides 1), and so both numbers are coprime, or relative prime, to each other.

Perhaps the simplicity of the algorithm is obscured by the usual practice of using modular division. In fact, modular division is not required - and the Greeks certainly did not use it! However, the Euclidean algorithm is also a great demonstration of the power of modular arithmetic. Test it with, say, a 10-digit number and a 3-digit number. The subtraction method will take thousands of iterations to produce a result. (If you get an overflow, it's probably because you've exceeded the listbox limit.) Then try replacing subtraction with the couple of lines of modular division in the code below, and see how the result is achieved within just a few iterations and a fraction of a second.