Recursive Greatest Common Divisor

Write a recursive method gcd(int a, int b) that returns the greatest common divisor of a and b using Euclid's algorithm: when b is 0 the answer is a; otherwise the answer is gcd(b, a % b). Call it with 48 and 18 and print the result (see Expected Output).

Use System.out.println.

Expected Output:

6↵

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

Hints4 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 (sysout, psvm, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.