-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathlinearsearchalgo.cpp
93 lines (66 loc) · 1.76 KB
/
linearsearchalgo.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/******************************************************************************
##only for particular Index ##
*******************************************************************************/
#include <iostream>
using namespace std;
int lwsearch(int arr[] , int s){
//cout << arr[0] <<endl;
if (arr[0] == s) {
return 0;
}
else
{
return -1;
}
}
int main()
{
int data[] = {1,2,3,4,5,6,7};
int search = 7;
cout << lwsearch(data , search) << endl;
}
/******************************************************************************
## our Main code ## using for loop
*******************************************************************************/
#include <iostream>
using namespace std;
int lwsearch(int arr[] , int s){
for (int i=0; i<=7 ;i++)
{
if (arr[i] == s) {
return 0;
}
}
}
int main()
{
int data[] = {1,2,3,4,5,6,7};
int search = 7;
cout << lwsearch(data , search) << endl;
}
/******************************************************************************
Linear search Algorithm
*******************************************************************************/
#include <iostream>
using namespace std;
int lwsearch(int data[] , int searchTerm ,int length){
for (int i=0; i<=length-1 ;i++){
if (data[i] == searchTerm) {
return i;
}
}
return -1;
}
int main()
{
int data[] = {1,2,3,4,5,6,7};
int searchTerm = 7;
int length = sizeof(data) / sizeof(int);
cout << lwsearch(data , searchTerm, length ) << endl;
if (rcode == 0){
cout<<"we found ..." << endl;
}
else{
cout<<"not found ...."<< endl;
}
}