\n

This WSQ consisted on using the Euclidean Algorithm to calculate the Greatest Common Divisor of two values. To understand this concept I had to watch a video explaining it: https:\/<\/wbr>\/<\/wbr>www.youtube.com\/<\/wbr>watch?v=AJn843kplDw<\/a><\/p>\n

Afterwards, it resulted easy to turn this into code since it consists on repetition and reassignment of values. I had no trouble since I have done it in previous WSQs. The idea of turning it into a funtion was simple since it consisted only on grabbing that segment of the code and turning it into a function.<\/p>\n

Here’s the code:\u00a0<\/p>\n

https:\/<\/wbr>\/<\/wbr>github.com\/<\/wbr>CarlosGallegosT\/<\/wbr>Codes007\/<\/wbr>blob\/<\/wbr>master\/<\/wbr>Euclidean_Algorithm.cpp<\/a><\/p>\n

#TC1017<\/a> #WSQ12<\/a><\/p>\n

\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0<\/p>\n

Image Source:\u00a0http:\/<\/wbr>\/<\/wbr>web.williams.edu\/<\/wbr>Mathematics\/<\/wbr>lg5\/<\/wbr>C15W13\/<\/wbr>summary.html<\/a><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"