(function(){ window.OpenPopKa = true;}())

The greatest common divisor (GCD) of a pair of numbers is the largest positive integer that divides both numbers without remainder. For function "GCD", write the missing base case condition and action. This function will compute the greatest common divisor of "x" and "y". You can assume that "x" and "y" are both integers greater than 0 and x > y. Greatest common divisor is computed as follows:

GCD(x, 0) = x
GCD(x, y) = GCD(y, x % y)

[editor.getValue()]
if (guess[0] != initEditor) { console.log(guess[0]); window.codeValue = guess[0]; window.progexType= "RecurTutor"; window.summexName= "RecCGcdPROG"; } else { return ""; }

Look at the base case in the first line of the definition given for GCD.