FilesExpand file tree

 master

/

GCD.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

38 lines (29 loc) · 969 Bytes

 master

/

GCD.java

Copy path

Top

File metadata and controls

• Code
• Blame

38 lines (29 loc) · 969 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

31

32

33

34

35

36

37

38

//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) {

if (num1 == 0)

return num2;

while (num2 != 0) {

if (num1 > num2)

num1 -= num2;

else

num2 -= num1;

}

return num1;

}

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)); // => 4

System.out.printf("gcd(40,24)=%d gcd(24,40)=%d\n", gcd(40, 24), gcd(24, 40)); // => 8

}

}