FilesExpand file tree

 master

/

GCD.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

30 lines (25 loc) · 778 Bytes

 master

/

GCD.java

Copy path

Top

File metadata and controls

• Code
• Blame

30 lines (25 loc) · 778 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

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 num1, int num2) {

int gcdValue = num1 % num2;

while (gcdValue != 0) {

num2 = gcdValue;

gcdValue = num2 % gcdValue;

}

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));

}

}