Blame for benchmarks/quixbugs/java/GCD.java

import java.util.*;

/**
 * Input:
 *     a: A nonnegative int
 *     b: A nonnegative int
 * 
 * 
 * Greatest Common Divisor
 * 
 * Precondition:
 *     isinstance(a, int) and isinstance(b, int)
 * 
 * Output:
 *     The greatest int that divides evenly into a and b
 * 
 * Example:
 *     >>> gcd(35, 21)
 *     7
 *
 * @author derricklin
 */
public class GCD {

    public static int gcd(int a, int b) {
        if (b == 0) {
            return a;
        } else {
            return gcd(b, a%b);
        }
    }
}