Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 7 additions & 0 deletions src/main/java/com/thealgorithms/searches/JumpSearch.java
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
Loading