We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 79bc620 commit ca21a27Copy full SHA for ca21a27
src/main/java/com/thealgorithms/searches/JumpSearch.java
@@ -34,7 +34,14 @@
34
*
35
* <p>
36
* <b>Space Complexity:</b> O(1) - only uses a constant amount of extra space
37
- *
+ *
38
+ * <p>
39
+ * <b>Edge Cases:</b>
40
+ * <ul>
41
+ * <li>Empty array → returns -1</li>
42
+ * <li>Element not present → returns -1</li>
43
+ * <li>Single element array</li>
44
+ * </ul>
45
46
* <b>Note:</b> Jump Search requires a sorted array. For unsorted arrays, use Linear Search.
47
* Compared to Linear Search (O(n)), Jump Search is faster for large arrays.
0 commit comments