GCD - The Euclidean Algorithm
1. Assign M and N the value of the larger and the value of the smaller of the two positive integer input values, respectively.
2. Divide M by N and call the remainder R.
3. If R is not 0, then assign M the value of N, assign N the value of R and return to step 2, otherwise the greatest common divisor is the value currently assigned to N.