Welcome to collectivesolver - Programming & Software Q&A with Examples. A website you can trust. All programs tested and work.

Contact: aviboots(AT)netvision.net.il


Instant Grammar Checker - Correct all grammar errors and enhance your writing

Teach Your Child To Read

Survey Junkie is the #1 place online for your audience to earn rewards for their opinion.

100%
Managed VPS Hosting
Affordable. Secure. Your Own Virtual Private Hosting. Faster than AWS and Rackspace

Bonsai Boy of New York Bonsai Trees and Accessories
Liquid Web - Highest Level of Performance and Security with Managed Dedicated Servers

Disclosure We are a professional Programming & Software Q&A website, that receives compensation from some of the links whose we show you with Information. It means that my content may contain affiliate links.

21,340 questions

28,142 answers

573 users

How to calculate the GCD (greatest common divisor) of two integers using recursion in Java

1 Answer

0 votes
public class MyClass {
    static int getGCD_Recursion(int a, int b) {
        while (a != b) {
            if (a > b) {
                return getGCD_Recursion(a - b, b);
            }
            else {
                return getGCD_Recursion(a, b - a);
            }
        }
        return a;
    }
    public static void main(String args[]) {
        int a = 12, b = 20;
       
        System.out.printf("The GCD (greatest common divisor) of %d and %d is: %d\n", a, b, getGCD_Recursion(a, b));
    }
}




/*
run:
 
The GCD (greatest common divisor) of 12 and 20 is: 4
 
*/

 




answered Jan 12 by avibootz
edited Jan 12 by avibootz
...