ECX 30 Days of Code and Design
Day 11
Euclid's Algorithm (GCD)
The GCD (Greatest Common divisor) of two numbers is the largest number by which both are divisible. E.g.; gcd(42, 18) is 6, since 6 is the highest common factor (HCF—same thing as GCD) of...
