We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 79bc620 commit df8fd85Copy full SHA for df8fd85
src/main/java/com/thealgorithms/searches/JumpSearch.java
@@ -36,6 +36,13 @@
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
+ * <p>
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.
48
* Compared to Binary Search (O(log n)), Jump Search is less efficient but may be
0 commit comments