Medium

07. Recursion & Stack Frames

Problem Objective

Implement recursive greatest common divisor (Euclidean algorithm) int gcd(int a, int b).

Expected Terminal OutputStandard Out

GCD(48, 18) = 6

[✓] Euclidean GCD recursion verified (Time: 0.005s, Memory: 1.8 MB)

Execution Constraints

Implementation Checklist

Check b == 0Recursive call gcd(b, a % b)Test with 48 and 18

main.cgcc -std=c17 -O2

Loading Bytes Space Editor...