← Back to Methods
Question 148
Greatest Common Divisor
Greatest Common Divisor
Complete the static method Gcd so it returns the greatest common divisor of a and b using the Euclidean algorithm (repeatedly replace (a, b) with (b, a % b) until b is 0). Do NOT write a Main method.
For Gcd(12, 18) the program prints 6.Expected Output:
6= newline. The output ends with a newline — print one after the last line.
Hints4 available
Sign in to use hintsTopics:
Methods
1
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.