fix: enum should be compared using ==, according to maven bugs finder plugin

Alex Klymenko · Alex Klymenko · commit a8a7392e586f · 2024-07-01T22:08:09.000+02:00
diff --git a/src/main/java/com/thealgorithms/sorts/BeadSort.java b/src/main/java/com/thealgorithms/sorts/BeadSort.java
@@ -53,7 +53,7 @@ private int[] extractSortedFromGrid(final BeadState[][] grid) {
         int[] sorted = new int[grid.length];
         for (int i = 0; i < grid.length; i++) {
             int k = 0;
-            for (int j = 0; j < grid[grid.length - 1 - i].length && grid[grid.length - 1 - i][j].equals(BeadState.BEAD); j++) {
+            for (int j = 0; j < grid[grid.length - 1 - i].length && grid[grid.length - 1 - i][j] == BeadState.BEAD; j++) {
                 k++;
             }
             sorted[i] = k;

Original file line number	Diff line number	Diff line change
`@@ -53,7 +53,7 @@ private int[] extractSortedFromGrid(final BeadState[][] grid) {`
`53`	`53`	`int[] sorted = new int[grid.length];`
`54`	`54`	`for (int i = 0; i < grid.length; i++) {`
`55`	`55`	`int k = 0;`
`56`		`- for (int j = 0; j < grid[grid.length - 1 - i].length && grid[grid.length - 1 - i][j].equals(BeadState.BEAD); j++) {`
	`56`	`+ for (int j = 0; j < grid[grid.length - 1 - i].length && grid[grid.length - 1 - i][j] == BeadState.BEAD; j++) {`
`57`	`57`	`k++;`
`58`	`58`	`}`
`59`	`59`	`sorted[i] = k;`