COMPUTE THE GCD/HCF OF TWO NUMBERS
This program computes the greatest common divisor (gcd) of two numbers,
and , using the Euclidean Algorithm. Generally, the gcd of two numbers and is denoted by gcd( , ) or ( , ).
The Analytical Engine weaves algebraic patterns, just as the Jacquard loom weaves flowers and leaves.
- Ada Lovelace