GCD with While Loop

Compute the greatest common divisor (GCD) of 48 and 36 using the Euclidean algorithm in a while loop, then print:

GCD: 12

Repeatedly replace the pair (a, b) with (b, a % b) until b becomes 0; the answer is then a.

Expected Output:

GCD: 12

Topics:

Loops

Code Editor

Tab to indent · Ctrl+Enter to run · 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.