GCD

public class GCD {
    public static void main(String[] args) {
        System.out.println();
        getGreatestCommonDivisor(25, 15);
        getGreatestCommonDivisor(25, 25);
        getGreatestCommonDivisor(12, 30);
        getGreatestCommonDivisor(40, 140);
        getGreatestCommonDivisor(81, 153);
        getGreatestCommonDivisor(559, 1000);
        getGreatestCommonDivisor(9999, 29997);

    }


    public static void getGreatestCommonDivisor(int a, int b) {
        int while_max = 0;
        int x = 1;
        int GrtComDemon = 0;

        // determines the lowest of the two numbers for the while loop to save cycles.
        if (a < b) {
            while_max = b + 1;
        } else {
            while_max = a + 1;
        }

        // if two numbers are the same, they are the GCD
        if (a == b) {
            System.out.println("Greatest Common Denominator of " + a + " and " + b + " is " + a);
        } else {

            while (x < while_max) {
                if ((a % x == 0) && (b % x == 0)) GrtComDemon = x;
                x++;
            }
            System.out.println("Greatest Common Demoninator of " + a + " and " + b + " is " + GrtComDemon);
        }


    }
}