by vince choi
This flow looks for the GCD of the two numbers based on euclidian algorithm(modulus principle).
Well, we were taught at grade school on how to get the GCD between two numbers through prime factorization, but obviously, it gets harder whenever the numbers that we're dealing with gets bigger.
Euclid, one of the famous mathematicians of his time, devised or formulated this algorithm back in the midst of 4th to 3rd century B.C. (either because, he was a genius or, he was just lazy doing factorization XD, peace).
IDK if arrays can be used to cut off the number of blocks, haha, newbie here XD.
. . . more flows to come, see ya !
Reviews and ratings can be submitted in the app.