Perform the greatest common divisor between two integers (Recursive Euclidian algorithm).
[G] = NL_S_GCDRecursive(A,B)
Integer.
Integer.
Greatest common divisor.
NL_S_GCDRecursive performs the greatest common divisor (GCD) G of the two integers A and B in respect with the Recursive Euclidian algorithm (WIKIPEDIA).
function gcd(a, b) if b = 0 return a else return gcd(b, a mod b) | ![]() | ![]() |