Skip to content

Add Jump Search algorithm in Java #6407

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

Jump to bottom
Open
wants to merge 11 commits into
base: master
Choose a base branch
from
Open

Add Jump Search algorithm in Java #6407

wants to merge 11 commits into from
+45 −88

Conversation

Fahham2903
Copy link

Added an implementation of the Jump Search algorithm in Java.
This is part of my first real code-based open source contribution.

@codecov-commenter
Copy link

codecov-commenter commented Jul 18, 2025 •
edited
Loading

Codecov Report

Attention: Patch coverage is 85.71429% with 2 lines in your changes missing coverage. Please review.

Project coverage is 74.64%. Comparing base (2f2a32b) to head (96e036e).
Report is 1 commits behind head on master.

Files with missing lines Patch % Lines
...in/java/com/thealgorithms/searches/JumpSearch.java 85.71% 2 Missing ⚠️
Additional details and impacted files 
@@             Coverage Diff              @@
##             master    #6407      +/-   ##
============================================
- Coverage     74.65%   74.64%   -0.01%     
  Complexity     5459     5459              
============================================
  Files           682      682              
  Lines         19010    19016       +6     
  Branches       3670     3671       +1     
============================================
+ Hits          14191    14195       +4     
- Misses         4259     4261       +2     
  Partials        560      560

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:
  • ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

@Fahham2903
Copy link
Author

All required checks have passed except Infer, which is failing due to a known camlzip dependency issue. This error is unrelated to my changes.
Ready for review.

@DenizAltunkapan
Copy link
Collaborator

The older version is preferable because it is generic, allowing searches on any comparable type, not just primitive int. It also implements a standard SearchAlgorithm interface, which improves code modularity, testability, and reuse. The new version’s static methods and manual conversion from Integer[] to int[] introduce unnecessary overhead and reduce flexibility. Therefore, i would say the older version is cleaner, more extensible...
Please try to contribute in another way :]

@alxkm thoughts?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@DenizAltunkapan DenizAltunkapan Awaiting requested review from DenizAltunkapan DenizAltunkapan is a code owner

@yanglbme yanglbme Awaiting requested review from yanglbme yanglbme is a code owner

@vil02 vil02 Awaiting requested review from vil02 vil02 is a code owner

@alxkm alxkm Awaiting requested review from alxkm alxkm is a code owner

At least 1 approving review is required to merge this pull request.

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
3 participants
@Fahham2903 @codecov-commenter @DenizAltunkapan
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy