Greatest common divisor recursion example

GCD.java

public class GCD {
  public static void main(String[] args) {
		// jacked the test values from wikipedia
    // output should be 37
    System.out.println(gcd(259,111));
	}

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