-
-
Notifications
You must be signed in to change notification settings - Fork 7.5k
Add Jump Search algorithm in searching/jump_search.cpp #2974
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.
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
Open
saksham23467
wants to merge
1
commit into
TheAlgorithms:master
Choose a base branch
from
saksham23467:add-binary-search
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,40 @@ | ||
#include <iostream> | ||
#include <vector> | ||
#include <cmath> | ||
using namespace std; | ||
|
||
/** | ||
* @brief Performs Jump Search on a sorted vector. | ||
* | ||
* @param arr The sorted vector to search in. | ||
* @param target The value to search for. | ||
* @return Index of target if found, else -1. | ||
*/ | ||
int jump_search(const vector<int>& arr, int target) { | ||
int n = arr.size(); | ||
int step = sqrt(n); | ||
int prev = 0; | ||
|
||
while (arr[min(step, n) - 1] < target) { | ||
prev = step; | ||
step += sqrt(n); | ||
if (prev >= n) return -1; | ||
} | ||
|
||
for (int i = prev; i < min(step, n); i++) { | ||
if (arr[i] == target) return i; | ||
} | ||
|
||
return -1; | ||
} | ||
|
||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. please add a tests function, The main function should only contain a call to tests function |
||
int main() { | ||
vector<int> arr = {1, 3, 5, 7, 9, 13, 17, 21}; | ||
int target = 13; | ||
int result = jump_search(arr, target); | ||
if (result != -1) | ||
cout << "Found at index: " << result << endl; | ||
else | ||
cout << "Not found" << endl; | ||
return 0; | ||
} |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.