For this WSQ i had to find the greatest common divisor of two numbers using Euclid's algorithm.
I had no idea what Euclid's algorithm was so I did a little research and found this useful video that helped me make the code: Click to watch
Link to the code: Code
At first i had some trouble developing this code so, as you can see, i put a lot of SOP's (System.out.println) in between lines to check better what was going on and after about half an hour i realized what I was missing in my code.
To be honest i wasn't able to do this without the help of my good friend Itzel because she explained me the method that I aplied in my code.
Link to Itzel's blog: Itzel's Blog
Picture of my Code:
Gilberto Rogel García - a01630171