Greatest Common Divisor
This WSQ was easy, I only had to read about the Euclid’s algorithm to understand a little bit how I had to do it.
I read about Euclid’s algorithm in this website: https://en.wikipedia.org/wiki/Euclidean_algorithm
Picture taken from: https://en.wikipedia.org/wiki/Euclidean_algorithm
And here my code uploaded on github: https://github.com/manuelgodm/TC101/blob/master/GreatestCommonDivisor.cpp
#WSQ12 by Manuel Godínez Márquez is licensed under a Creative Commons Attribution 4.0 International License.