Java Program for Basic Euclidean algorithms
Last Updated :
04 Dec, 2018
GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and multiply common factors.
import java.util.*;
import java.lang.*;
class GFG {
public static int gcd( int a, int b)
{
if (a == 0 )
return b;
return gcd(b % a, a);
}
public static void main(String[] args)
{
int a = 10 , b = 15 , g;
g = gcd(a, b);
System.out.println( "GCD(" + a + ", " + b + ") = " + g);
a = 35 ;
b = 10 ;
g = gcd(a, b);
System.out.println( "GCD(" + a + ", " + b + ") = " + g);
a = 31 ;
b = 2 ;
g = gcd(a, b);
System.out.println( "GCD(" + a + ", " + b + ") = " + g);
}
}
|
Output:
GCD(10, 15) = 5
GCD(35, 10) = 5
GCD(31, 2) = 1
Time Complexity: O(Log min(a, b))
Please refer complete article on Basic and Extended Euclidean algorithms for more details!
Share your thoughts in the comments
Please Login to comment...