Function: Recursive GCD

Write a recursive function gcd(int a, int b) that returns the greatest common divisor using Euclid's algorithm: if b == 0 return a, otherwise return gcd(b, a % b). Call it with 48 and 36 and print the result (see Expected Output).

Print with %d.

Expected Output:

= newline. No newline after the last line.

Hints4 available

Topics:

Functions/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 (p, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.