WSQ06 – Greatest Common Divisor

Here’s my code for the WSQ06.

It was really interesting finding an easy way to find the greatest common divisor of two numbers to apply it with programming, I finally decided to use Euclid’s algorithm.

You can find out more about the algorithm here.

Thanks for reading!