lab01.cpp
Problem Statement
lab01.cpp
Write a program in C++ to implement Linear Search using class, constructor, member variables, member functions, destructor
Source Code
cpp
#include<iostream>
using namespace std;
template <class T>
class linearSearch {
private:
T *arr;
int n;
public:
linearSearch(int size) {
n = size;
arr = new T[n];
cout << "Enter " << n << " elements: ";
for(int i = 0; i < n; i++) {
cin >> arr[i];
}
}
void searchElement(T key) {
bool keyFound = false;
for(int i = 0; i < n; i++) {
if(arr[i] == key) {
keyFound = true;
cout << "\nKey found at Index " << i;
}
}
if(!keyFound) {
cout << "\nKey not found.";
}
}
~linearSearch() {
delete[] arr;
cout << "\nMemory released.";
}
};
int main() {
int size;
int key;
cout << "Please enter the size: ";
cin >> size;
linearSearch<int> ls(size);
cout << "\nPlease enter the key: ";
cin >> key;
ls.searchElement(key);
return 0;
}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
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