Skip to content

update gcd #993

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
yanglbme merged 1 commit into from
Oct 8, 2019
Merged

update gcd #993

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
35 changes: 25 additions & 10 deletions Others/GCD.java → Maths/GCD.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
package Others;
package Maths;

/**
* This is Euclid's algorithm which is used to find the greatest common denominator
Expand All @@ -8,21 +8,36 @@
*/
public class GCD {

/**
* get greatest common divisor
*
* @param num1 the first number
* @param num2 the second number
* @return gcd
*/
public static int gcd(int num1, int num2) {
if (num1 < 0 || num2 < 0) {
throw new ArithmeticException();
}

if (num1 == 0)
return num2;

while (num2 != 0) {
if (num1 > num2)
num1 -= num2;
else
num2 -= num1;
if (num1 == 0 || num2 == 0) {
return Math.abs(num1 - num2);
}

return num1;
while (num1 % num2 != 0) {
int remainder = num1 % num2;
num1 = num2;
num2 = remainder;
}
return num2;
}

/**
* get greatest common divisor in array
*
* @param number contains number
* @return gcd
*/
public static int gcd(int[] number) {
int result = number[0];
for (int i = 1; i < number.length; i++)
Expand Down
36 changes: 36 additions & 0 deletions Maths/GCDRecursion.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
package Maths;

/**
* @author https://github.com/shellhub/
*/
public class GCDRecursion {
public static void main(String[] args) {
System.out.println(gcd(20, 15)); /* output: 5 */
System.out.println(gcd(10, 8)); /* output: 2 */
System.out.println(gcd(gcd(10, 5), gcd(5, 10))); /* output: 5 */
}

/**
* get greatest common divisor
*
* @param a the first number
* @param b the second number
* @return gcd
*/
public static int gcd(int a, int b) {

if (a < 0 || b < 0) {
throw new ArithmeticException();
}

if (a == 0 || b == 0) {
return Math.abs(a - b);
}

if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
}