WAP of Linear Search in C++

/*WAP of Linear Search in C++*/

#include<iostream.h>
#include<conio.h>

class linearSearch
{
 int size, a[100],item;
 public:
 void setData();
 void searchItem();

};
void linearSearch :: setData()
{
 int i;
 cout << "\nEnter total number of elements: " ;
 cin >> size;

 
 cout << "\nEnter elements: ";
 for(i=0;i> a[i];

 cout << "\nEnter Item which you want to find: ";
 cin >> item;

}
void linearSearch :: searchItem()
{
 int k=1, loc=0;
 while(loc==0 && k<=size)
 {
  if(item == a[k-1])
  {
   loc = k;
  }
  k +=1;
 }
 if(loc==0)
  cout << "\n" << item << " isn't Found.";
 else
  cout << "\n" << item << " at Location " << loc;
}

void main()
{
 clrscr();
 linearSearch bsrch;
 bsrch.setData();
 bsrch.searchItem();

 getch();
}