Recursive GCD Method

Write the static method Gcd so it returns the greatest common divisor of two non-negative integers using the recursive Euclidean algorithm: when b is 0 the answer is a, otherwise the answer is Gcd(b, a % b). The tester calls it and prints the result. Do NOT write a Main method.

For Gcd(48, 18) the program prints exactly the output shown in Expected Output.

Expected Output:

6↵

= newline. The output ends with a newline — print one after the last line.

Hints2 available

Topics:

Methods

Code Editor

Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Shift+Alt+F to format · Ctrl+Space to expand shortcuts (cw, cr, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.