Solution Review 1: Euclidean Algorithm
This review discusses the solution of the Euclidean algorithm challenge in detail from basic to extensive level.
How does the Euclidean algorithm work?
The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger value of the two is replaced by the difference between both numbers.
Let’s look at an example:
The GCD of and is ( = x and = x ). Now, is also the GCD of ...
Source: Euclidean Algorithm - Wikipedia under lisense CC-BY-SA 3.0