Mirrors/interview
1
0
Fork 0
mirror of https://github.com/huihut/interview.git synced 2025-12-18 21:14:38 +03:00
Code Issues Actions Packages Projects Releases Wiki Activity

Added a better way of Sequential search to existing file

Browse Source
This commit is contained in:
Gurs
2020-09-01 23:29:04 +05:30
parent ff14ce5c49
commit ec3ade0e35
1 changed files with 16 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
Algorithm/SequentialSearch.h
View File

@@ -5,3 +5,19 @@ int SequentialSearch(vector<int>& v, int k) {
return i; return i;
return -1; return -1;
} }
/* The following is a Sentinel Search Algorithm which only performs
just one test in each loop iteration thereby reducing time complexity */
int BetterSequentialSearch(vector<int>& v, int k) {
int last = v[v.size()-1];
v[v.size()-1] = k;
int i = 0;
while (v[i]!= k)
i++;
v[v.size()-1] = last;
if(i < v.size()-1 || v[v.size()-1] == k)
return i;
return -1;
}