We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 6e8fc5c commit 07eade8Copy full SHA for 07eade8
src/main/java/com/thealgorithms/searches/BinarySearch2dArray.java
@@ -63,11 +63,11 @@ else if (arr[midRow][midCol] < target) {
63
// If the target wasn't found during the row search, check the middle column of
64
// startRow and endRow.
65
if (arr[startRow][midCol] == target) {
66
- return new int[] { startRow, midCol };
+ return new int[] {startRow, midCol};
67
}
68
69
if (arr[endRow][midCol] == target) {
70
- return new int[] { endRow, midCol };
+ return new int[] {endRow, midCol};
71
72
73
// If target is smaller than the element in the left of startRow, perform a
0 commit comments