FazBrowse GitHub Viewer | Trending | | Home

Tools: [Download Repo ZIP] [View Raw Code] [Original HTTPS Page]

Java-DSA/GreedyAlgorithm.java at main · shanks-d-fury/Java-DSA · GitHub

39 lines (36 loc) · 1.05 KB

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

39

import java.util.Arrays;

public class GreedyAlgorithm {

public static void main(String args[]) {

int vertical[] = { 2, 1, 3, 1, 4 };

int horizontal[] = { 4, 1, 2 };

int vi = vertical.length - 1;

int hj = horizontal.length - 1;

int vpart = 1;

int hpart = 1;

int totalCost = 0;

Arrays.sort(vertical);

Arrays.sort(horizontal);

while (vi >= 0 && hj >= 0) {

if (horizontal[hj] >= vertical[vi]) {

totalCost += (vpart * horizontal[hj]);

hpart++;

hj--;

} else {

totalCost += (hpart * vertical[vi]);

vpart++;

vi--;

}

}

while (vi >= 0) {

totalCost += (hpart * vertical[vi]);

vpart++;

vi--;

}

while (hj >= 0) {

totalCost += (vpart * horizontal[hj]);

hpart++;

hj--;

}

System.out.println("Total Minimum cost of cutting is : " + totalCost);

}

}

Back | FazBrowse Home | New Git URL