In this WSQ we calculated the gcd of two numbers using the Euclid’s algorithm in a function. In the main function we ask to the user to give two integers, them the function takes these numbers in order to return the gcd.
I understood the Euclid’s algorithm i this video: https://www.youtube.com/watch?v=UgzeLY0KO3U
Also, I found easier ways to get the gcd, but we should use the Euclid’s algorithm.
Here is the link to GitHub: https://github.com/tonygarciavz/A01630861-TC1017/blob/master/WSQ12