algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-19 17:54:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: update the whole repository

Browse Source 
* fix some bugs
* delete duplicate files
* format code
This commit is contained in:
yanglbme
2019-05-09 19:32:54 +08:00
parent 163db8521a
commit 29948363da
368 changed files with 4372 additions and 30841 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
Others/GCD.java
View File

@ -1,7 +1,11 @@
//Oskar Enmalm 3/10/17
//This is Euclid's algorithm which is used to find the greatest common denominator
//Overide function name gcd
package Others;
/**
* This is Euclid's algorithm which is used to find the greatest common denominator
* Overide function name gcd
*
* @author Oskar Enmalm 3/10/17
*/
public class GCD {
public static int gcd(int num1, int num2) {
@ -29,8 +33,8 @@ public class GCD {
}
public static void main(String[] args) {
int[] myIntArray = { 4, 16, 32 };
int[] myIntArray = {4, 16, 32};
// call gcd function (input array)
System.out.println(gcd(myIntArray)); // => 4
System.out.printf("gcd(40,24)=%d gcd(24,40)=%d\n", gcd(40, 24), gcd(24, 40)); // => 8