Hey guys, this time we have to solve quiz number 6, which was really easy, if you need help about how does this algorythm works, you can search on YouTube or any web site.
This time, we have to calculate the Greatsest Common Divisor of two numbers, solving the euclid algorythm, which you need to write a function uisng a parameters A and B and using an if else loop, giving a remainder C about A and B.
In order to understand better this topic, I will show you my code written in Atom as an editor:
And here is the code compiled using Cygwin as a terminal:
And here is the code from GitHub:
https://gist.github.com/DiegoNaterasPonce/9573605ac8edf69a269e
#Quiz6 by Diego Nateras Ponce is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
