linear search

#include <iostream>
using namespace std;
class lsearch1
{
private:
int a[50], n, count, key;
public:
void init();
void linear();
};
void lsearch1::init()
{
count = 0; }

void lsearch1::linear()
{
int i;
cout << "\n Enter size of array:";
cin >> n;
cout << "\n Enter n elements into array:";
for (i = 0; i < n; i++)
cin >> a[i];
cout << "\n Enter search element:";
cin >> key;
for (i=0;i<n;i++)
if (a[i] == key) {
count++;
break; }
if (count == 1)
cout << "\n Element found in " << i + 1 << " location";
else
cout << "\n Element is not found";
}
int main() {
lsearch1 ob; ob.init(); ob.linear();
return 0; }