Greatest Common Divisor in Java, Euclidean Algorithm

public int gcd(int n1, int n2) {
    if (n2 == 0) {
        return n1;
    }
    return gcd(n2, n1 % n2);
}