Skip to content

Added Jump Search in C++ #24

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

Open
Sunainacode wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Added Jump Search in C++ #24

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
2881868
Create jump_search.cpp
Sunainacode Oct 5, 2021
573b13a
Create readme.md
Sunainacode Oct 5, 2021
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
33 changes: 33 additions & 0 deletions Jump Search/jump_search.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
#include<iostream>
#include<math.h>
using namespace std;
int main(){
int n;
cout<<"Enter the number of elements: ";
cin>>n;
cout<<"Enter the elements in the sorted order: ";
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int d;
cout<<"Enter the element to search: ";
cin>>d;
int x,i;
cout<<"Enter the skip count: (Preferred: "<<int(sqrt(n))<<" )";
cin>>x;
for(i=0;i<n;i+=x){
if(a[i+x]>d){
break;
}
}
for(int t=i;t<n;t++){
if(a[t]==d){
cout<<"Element was found at position: "<<t;
break;
}
else if(t==n-1 && a[t]!=d){
cout<<"Element was not found!"<<endl;
}
}
}
3 changes: 3 additions & 0 deletions Jump Search/readme.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
<h3> Jump Search </h3>
Jump Search is a faster algorithm than Binary search. It is just a modified form of binary search where a small range of numbers are found in which the desired number lies by jumping some indexes in between. Then the desired index is found out by using linear search in that particular small range. The number of indices jumped is preferred to be the square root of the length of array.<br>
Time Complexity: O(n/m + (m-1)) where n is the length of array and m is the jump size. <br>