RosettaCodeData/Task/Greatest-common-divisor/Java/greatest-common-divisor-1.java

/* recursive */
int gcd(int a, int b) {
    return (b == 0) ? a : gcd(b, a % b);
}