GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them.
For example GCD of 20 and 28 is 4 and GCD of 98 and 56 is 14.
A simple solution is to find all prime factors of both numbers, then find intersection of all factors present in both numbers. Finally return product of elements in the intersection.
An efficient solution is to use Euclidean algorithm which is the main algorithm used for this purpose. The idea is, GCD of two numbers doesn’t change if smaller number is subtracted from a bigger number.
C++
// C++ program to find GCD of two numbers #include <iostream> using namespace std; // Recursive function to return gcd of a and b int gcd(int a, int b) { // Everything divides 0 if (a == 0) return b; if (b == 0) return a; // base case if (a == b) return a; // a is greater if (a > b) return gcd(a-b, b); return gcd(a, b-a); } // Driver program to test above function int main() { int a = 98, b = 56; cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b); return 0; } |
chevron_right
filter_none
C
// C program to find GCD of two numbers #include <stdio.h> // Recursive function to return gcd of a and b int gcd(int a, int b) { // Everything divides 0 if (a == 0) return b; if (b == 0) return a; // base case if (a == b) return a; // a is greater if (a > b) return gcd(a-b, b); return gcd(a, b-a); } // Driver program to test above function int main() { int a = 98, b = 56; printf("GCD of %d and %d is %d ", a, b, gcd(a, b)); return 0; } |
chevron_right
filter_none
Java
// Java program to find GCD of two numbers class Test { // Recursive function to return gcd of a and b static int gcd(int a, int b) { // Everything divides 0 if (a == 0) return b; if (b == 0) return a; // base case if (a == b) return a; // a is greater if (a > b) return gcd(a-b, b); return gcd(a, b-a); } // Driver method public static void main(String[] args) { int a = 98, b = 56; System.out.println("GCD of " + a +" and " + b + " is " + gcd(a, b)); } } |
chevron_right
filter_none
Python3
# Recursive function to return gcd of a and b def gcd(a,b): # Everything divides 0 if (a == 0): return b if (b == 0): return a # base case if (a == b): return a # a is greater if (a > b): return gcd(a-b, b) return gcd(a, b-a) # Driver program to test above function a = 98b = 56if(gcd(a, b)): print('GCD of', a, 'and', b, 'is', gcd(a, b)) else: print('not found') # This code is contributed by Danish Raza |
chevron_right
filter_none
C#
// C# program to find GCD of two // numbers using System; class GFG { // Recursive function to return // gcd of a and b static int gcd(int a, int b) { // Everything divides 0 if (a == 0) return b; if (b == 0) return a; // base case if (a == b) return a; // a is greater if (a > b) return gcd(a - b, b); return gcd(a, b - a); } // Driver method public static void Main() { int a = 98, b = 56; Console.WriteLine("GCD of " + a +" and " + b + " is " + gcd(a, b)); } } // This code is contributed by anuj_67. |
chevron_right
filter_none
PHP
<?php // PHP program to find GCD // of two numbers // Recursive function to // return gcd of a and b function gcd($a, $b) { // Everything divides 0 if ($a == 0) return $b; if ($b == 0) return $a; // base case if($a == $b) return $a ; // a is greater if($a > $b) return gcd( $a-$b , $b ) ; return gcd( $a , $b-$a ) ; } // Driver code $a = 98 ; $b = 56 ; echo "GCD of $a and $b is ", gcd($a , $b) ; // This code is contributed by Anivesh Tiwari ?> |
chevron_right
filter_none
Output:
GCD of 98 and 56 is 14
A more efficient solution is to use modulo operator in Euclidean algorithm .
C++
// C++ program to find GCD of two numbers #include <iostream> using namespace std; // Recursive function to return gcd of a and b int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } // Driver program to test above function int main() { int a = 98, b = 56; cout<<"GCD of "<<a<<" and "<<b<<" is "<<gcd(a, b); return 0; } |
chevron_right
filter_none
C
// C program to find GCD of two numbers #include <stdio.h> // Recursive function to return gcd of a and b int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } // Driver program to test above function int main() { int a = 98, b = 56; printf("GCD of %d and %d is %d ", a, b, gcd(a, b)); return 0; } |
chevron_right
filter_none
Java
// Java program to find GCD of two numbers class Test { // Recursive function to return gcd of a and b static int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } // Driver method public static void main(String[] args) { int a = 98, b = 56; System.out.println("GCD of " + a +" and " + b + " is " + gcd(a, b)); } } |
chevron_right
filter_none
Python3
# Recursive function to return gcd of a and b def gcd(a,b): # Everything divides 0 if (b == 0): return a return gcd(b, a%b) # Driver program to test above function a = 98b = 56if(gcd(a, b)): print('GCD of', a, 'and', b, 'is', gcd(a, b)) else: print('not found') # This code is contributed by Danish Raza |
chevron_right
filter_none
C#
// C# program to find GCD of two // numbers using System; class GFG { // Recursive function to return // gcd of a and b static int gcd(int a, int b) { if (b == 0) return a; return gcd(b, a % b); } // Driver method public static void Main() { int a = 98, b = 56; Console.WriteLine("GCD of " + a +" and " + b + " is " + gcd(a, b)); } } // This code is contributed by anuj_67. |
chevron_right
filter_none
PHP
<?php // PHP program to find GCD // of two numbers // Recursive function to // return gcd of a and b function gcd($a, $b) { // Everything divides 0 if($b==0) return $a ; return gcd( $b , $a % $b ) ; } // Driver code $a = 98 ; $b = 56 ; echo "GCD of $a and $b is ", gcd($a , $b) ; // This code is contributed by Anivesh Tiwari ?> |
chevron_right
filter_none
Output:
GCD of 98 and 56 is 14
Please refer GCD of more than two (or array) numbers to find HCF of more than two numbers.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Program to find LCM of two numbers
- Program to find LCM of 2 numbers without using GCD
- Program to find LCM of two Fibonnaci Numbers
- Program to find sum of first n natural numbers
- Program to find first N Iccanobif Numbers
- Program to find sum of prime numbers between 1 to n
- Program to find first N Fermat Numbers
- Program to find the LCM of two prime numbers
- C/C++ Program to find Prime Numbers between given range
- Program to find GCD of floating point numbers
- C program to Find the Largest Number Among Three Numbers
- Program to find if two numbers and their AM and HM are present in an array using STL
- Program to find the percentage of difference between two numbers
- Program to find the common ratio of three numbers
- Program to find the maximum difference between the index of any two different numbers
- Program to find HCF (Highest Common Factor) of 2 Numbers
- Program to find GCD or HCF of two numbers using Middle School Procedure
- Program to find count of numbers having odd number of divisors in given range
- C++ program to find all numbers less than n, which are palindromic in base 10 and base 2.
- Find ratio of zeroes, positive numbers and negative numbers in the Array
