This task was quite easy, it was possible to do only reading about Euclid’s algorithm. Even in wikipedia.

It was just taking both numbers and getting its module, then dividing the second number and the module, until the module was 0.


CC BY 4.0 #WSQ12 GCD by eduardomacielm is licensed under a Creative Commons Attribution 4.0 International License.