gcd.java

// better
int gcd(int x, int y) {
  while (y != 0) {
      int tmp = x % y;
      x = y;
      y = tmp;
  }
  return x;
}

// simple, but slow and make more stacks(in the int case, when the ratio of two numbers is close to the 1.61(Golden Ratio), up to 80(effective 40) stacks can be made)
int gcd(int x, int y) {
  return x == 0 ? y : gcd(y % x, x);
}

int gcd(int large, int small) {
  int temp;
  for (; ; ) {
    if (small > large) {
      temp = large;
      large = small;
      small = temp;
    }
    if (small == 0) return large;
    temp = large % small;
    large = small;
    small = temp;
  }
}