Tag: euclidean algorithm

Greatest common divisor code in C#

Reading Time: 1 minuteGreatest common divisor of two positive integer numbers N and M, both larger then zero is the largest integer R that divide both N and M. If for given N and M, greatest common divisor is 1, we say that

Tagged with: ,