test: increase SearchSortedMatrix coverage

Author: GziXnine

src/test/java/com/thealgorithms/matrix/SearchSortedMatrixTest.java

@@ -25,6 +25,11 @@ void emptyFirstRowReturnsFalse() {
         assertFalse(SearchSortedMatrix.search(new int[][] {{}}, 42));
     }
 
+    @Test
+    void nullFirstRowReturnsFalse() {
+        assertFalse(SearchSortedMatrix.search(new int[][] {null}, 42));
+    }
+
     @Test
     void findsExistingTargetInTypicalMatrix() {
         final int[][] matrix = {
@@ -40,6 +45,16 @@ void findsExistingTargetInTypicalMatrix() {
         assertTrue(SearchSortedMatrix.search(matrix, 1));
     }
 
+    @Test
+    void intSearchCoversAllComparisonBranches() {
+        final int[][] matrix = {
+            {1, 4},
+            {2, 5},
+        };
+
+        assertTrue(SearchSortedMatrix.search(matrix, 2));
+    }
+
     @Test
     void genericSearchFindsExistingTarget() {
         final Integer[][] matrix = {
@@ -54,6 +69,16 @@ void genericSearchFindsExistingTarget() {
         assertFalse(SearchSortedMatrix.search(matrix, 20, Comparator.naturalOrder()));
     }
 
+    @Test
+    void genericSearchCoversAllComparisonBranches() {
+        final Integer[][] matrix = {
+            {1, 4},
+            {2, 5},
+        };
+
+        assertTrue(SearchSortedMatrix.search(matrix, 2, Comparator.naturalOrder()));
+    }
+
     @Test
     void genericNullMatrixReturnsFalse() {
         assertFalse(SearchSortedMatrix.search((Integer[][]) null, 42, Comparator.naturalOrder()));