Greatest common divisor w/ the Euclidian algorithm

The Euclidian algorithm is being used in a Java function for finding the greatest common divisor. The simple function calls itself (recursion) until the greatest common divisor has been reached, at which point it is returned.

Contextual Ads

More Java Resources


  1. public int GCD(int x, int y)
  2. {
  3. if (y == 0)
  4. {
  5.  // When x % y is 0, we found the greatest common divisor
  6.  return x;
  7. }
  8. // Recursion
  9. return GCD(y, x % y);
  10. }

Leave a Reply

Your email address will not be published. Required fields are marked *

Back To Top