Skip to content

Increase recursive GCD #283

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
varunu28 merged 3 commits into from
Nov 2, 2017
Merged

Increase recursive GCD #283

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
3bd769d
Increase recursive GCD
teerapat1739 Oct 27, 2017
cc6af5f
create main function GCD
teerapat1739 Oct 27, 2017
205698d
Update GCD.java
teerapat1739 Oct 27, 2017
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
29 changes: 22 additions & 7 deletions Others/GCD.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,15 +1,30 @@
//Oskar Enmalm 3/10/17
//This is Euclid's algorithm which is used to find the greatest common denominator
//Overide function name gcd

public class GCD{

public static int gcd(int a, int b) {

int r = a % b;
while (r != 0) {
b = r;
r = b % r;
public static int gcd(int num1, int num2) {
int gcdValue = num1 % num2;
while (gcdValue != 0) {
num2 = gcdValue;
gcdValue = num2 % gcdValue;
}
return b;
return num2;
}
public static int gcd(int[] number) {
int result = number[0];
for(int i = 1; i < number.length; i++)
//call gcd function (input two value)
result = gcd(result, number[i]);

return result;
}

public static void main(String[] args) {
int[] myIntArray = {4,16,32};
//call gcd function (input array)
System.out.println(gcd(myIntArray));
}
}