WSQ12

Hello everyone:

For my WSQ12 I created a function based on the Euclidean algorithm in order to calculate the greatest common divisor of two numbers. I actually found this web page very useful in order to understand what the algorithm is about: http://en.wikipedia.org/wiki/Euclidean_algorithm

Ken showed me how to calculate the gcd of two numbers by creating a function that uses recursion instead of a loop, so that´s why my code has two different functions. Here´s the link of my code https://github.com/JEduardotostado/TC1017/blob/master/WSQ12.cpp

#TC1017 #WSQ12