Implement Euclid's algorithm for finding the GCD of two integers. The algorithm is described below.

// TODO; describe it