Skip to content

feat: add StackUsingLinkedList implementation with tests #7382

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
prashantpiyush1111 wants to merge 12 commits into from
Closed

feat: add StackUsingLinkedList implementation with tests #7382

Changes from 1 commit
Commits
Show all changes
12 commits
Select commit Hold shift + click to select a range
ca21a27
docs: add edge cases to JumpSearch documentation
prashantpiyush1111 Apr 14, 2026
4c7ac35
fix: remove trailing whitespace (checkstyle)
prashantpiyush1111 Apr 14, 2026
56a087d
docs: add simple example and beginner-friendly explanation to JumpSearch
prashantpiyush1111 Apr 14, 2026
41020e5
feat: add StackUsingLinkedList implementation with test cases
prashantpiyush1111 Apr 15, 2026
db4e0c3
style: apply clang-format to fix formatting issues
prashantpiyush1111 Apr 15, 2026
43553e1
style: fix checkstyle issues (newline and imports)
prashantpiyush1111 Apr 15, 2026
bedd1ce
style: fix newline at end of StackUsingLinkedList
prashantpiyush1111 Apr 15, 2026
ca2cdfc
style: fix formatting to satisfy clang-format and checkstyle
prashantpiyush1111 Apr 15, 2026
f330d39
* This implementation uses a simple Node-based structure.
prashantpiyush1111 Apr 15, 2026
8d9ca35
Add edge cases section in JavaDoc for BinarySearch
prashantpiyush1111 Apr 16, 2026
4ed3134
Fix trailing spaces in BinarySearch documentation
prashantpiyush1111 Apr 16, 2026
edb8eab
Merge branch 'master' into stack-linkedlist
prashantpiyush1111 Apr 16, 2026
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
Prev Previous commit
Next Next commit
docs: add simple example and beginner-friendly explanation to JumpSearch
  • Loading branch information
@prashantpiyush1111
prashantpiyush1111 committed Apr 14, 2026
commit 56a087d5d7cc28aa42f459dee613eb4bf5fa7c55
11 changes: 11 additions & 0 deletions src/main/java/com/thealgorithms/searches/JumpSearch.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,6 +27,17 @@
* Result: Index = 4
*
* <p>
* <b>Example (Simple):</b><br>
* Input: arr = [2, 4, 6, 8, 10], key = 8<br>
* Output: 3
*
* <p>
* <b>Explanation (Easy):</b><br>
* Instead of checking every element one by one, Jump Search skips elements
* by jumping ahead fixed steps (√n). Once it finds a range where the element
* might exist, it performs a linear search in that smaller block.
*
* <p>
* <b>Time Complexity:</b><br>
* - Best-case: O(1) - element found at first position<br>
* - Average: O(√n) - optimal block size reduces jumps<br>
Expand Down
Loading