Algorithm to find GCD

• Use Euclid's algorithm to find GCD

• Divide the larger number by the smaller number

• If remainder is 0, smaller number is GCD

• If remainder is not 0, repeat with smaller number and remai...read more