GCD of Two Numbers in Java

**adisharma** · July 4th, 2022, 06:48 AM

Hello All, I am stack in gcd of two numbers problem. The problem statement is two non-negative integers a and b, we have to find their GCD (greatest common divisor),i.e. the largest number which is a divisor of both a and b. It’s commonly denoted by gcd(a,b) Check the code and Please suggest me, Is it right or not? I am using to solve this problem by Euclid’s Algorithm.

Taken this code reference from here - https://www.interviewbit.com/blog/gcd-of-two-numbers/

import java.util.*;
import java.lang.*;

class Interviewbit {
// extended Euclidean Algorithm
public static int gcd(int a, int b) {
if (a == 0)
return b;

return gcd(b % a, a);
}

}

**Norm** · July 4th, 2022, 07:14 AM

Do you have any specific java programming questions?
Do you have an algorithm that you are trying to write using java?

Please edit your post and wrap your code with code tags:

[code]
**YOUR CODE GOES HERE**
[/code]

to get highlighting and preserve formatting.

**AngleWyrm** · July 4th, 2022, 11:20 AM

int gcdByEuclidsAlgorithm(int n1, int n2) {
    if (n2 == 0) {
        return n1;
    }
    return gcdByEuclidsAlgorithm(n2, n1 % n2);
}

Should be functionally identical.

Thread: GCD of Two Numbers in Java

LinkBack

Thread Tools

Display

GCD of Two Numbers in Java

Re: GCD of Two Numbers in Java

Re: GCD of Two Numbers in Java

Similar Threads

Fibonacci numbers? How to define these numbers in some interval (diapazone)

2D array project. Takes a matrix of numbers, checks for errors in the surrounding cells, and changes numbers to symbols.

[SOLVED] Write a java program to display even numbers between 2 and 200 using netbeans java

[METHOD] How: Count how many prime numbers there is between two numbers!