Merge branch 'master' of https://github.com/Andruid929/algo-java into linkedstack

- Fell 2 commits behind while working

Author: Andruid929

src/main/java/com/thealgorithms/searches/JumpSearch.java

@@ -36,6 +36,13 @@
  * <b>Space Complexity:</b> O(1) - only uses a constant amount of extra space
  *
  * <p>
+ * <b>Edge Cases:</b>
+ * <ul>
+ *   <li>Empty array → returns -1</li>
+ *   <li>Element not present → returns -1</li>
+ *   <li>Single element array</li>
+ * </ul>
+ * <p>
  * <b>Note:</b> Jump Search requires a sorted array. For unsorted arrays, use Linear Search.
  * Compared to Linear Search (O(n)), Jump Search is faster for large arrays.
  * Compared to Binary Search (O(log n)), Jump Search is less efficient but may be

src/test/java/com/thealgorithms/searches/IterativeBinarySearchTest.java

@@ -87,6 +87,26 @@ void testBinarySearchEmptyArray() {
         assertEquals(-1, binarySearch.find(array, key), "The element should not be found in an empty array.");
     }
 
+    /**
+     * Test for binary search with a null array.
+     */
+    @Test
+    void testBinarySearchNullArray() {
+        IterativeBinarySearch binarySearch = new IterativeBinarySearch();
+        Integer key = 1;
+        assertEquals(-1, binarySearch.find(null, key), "The element should not be found in a null array.");
+    }
+
+    /**
+     * Test for binary search with a null key.
+     */
+    @Test
+    void testBinarySearchNullKey() {
+        IterativeBinarySearch binarySearch = new IterativeBinarySearch();
+        Integer[] array = {1, 2, 4, 8, 16};
+        assertEquals(-1, binarySearch.find(array, null), "A null search key should return -1.");
+    }
+
     /**
      * Test for binary search on a large array.
      */