Find the greatest common factor (GCF) of two numbers using Euclid's algorithm. The last segment in a row is the remainder. Each successive row equates to a recursive call with the two parameters being the second number, and the first number minus the second (with the larger of these two being first).
