public class Main {

    public static void main(String[] args) {

        System.out.println(getGreatestCommonDivisor (25, 15)); 

        // output is 5

    }

    public static int getGreatestCommonDivisor (int first, int second) {

        if (first < 10 || second < 10) {

            return -1;

        }

        int GCD = 1;

        for (int i = 1; i <= first && i <= second; i++) {

            if ((first % i == 0) && (second % i == 0)) {

                GCD = i;

            }

        }

        return GCD;

    }

}

int gcdByBruteForce(int n1, int n2) {

    int gcd = 1;

    for (int i = 1; i <= n1 && i <= n2; i++) {

        if (n1 % i == 0 && n2 % i == 0) {

            gcd = i;

        }

    }

    return gcd;

}

package com.company.Recursion;

​

public class GCD {

    public static void main(String[] args) {

        System.out.println("Result = " + euclid (24, 48));

        System.out.println("Result = " + euclid (125463, 9658));

​

    }

​

    public static int euclid(int num1, int num2) {

        if (num1 == 0 || num2 == 0) {

            return 1;

        } else if (num1 < num2) {

            int t = num1;

            num1 = num2;

            num2 = t;

        } if (num1 % num2 == 0) {

            return num2;

        } else {

            return euclid(num2, num1 % num2);

        }

    }

}

​