// Program to implement Linear search
#include<iostream.h>
#include<iomanip.h>
class linearsearch
{
private:
int *x;
int items;
public:
linearsearch(int);
~linearsearch();
void input(int []);
int search(int);
};
linearsearch::linearsearch(int n)
{
items=n;
x=new int[items];
}
linearsearch::~linearsearch()
{
delete [] x;
}
void linearsearch::input(int a[])
{
for(int i=0;i<items;i++)
x[i]=a[i];
}
int linearsearch::search(int number)
{
for(int i=0;i<items;i++)
{
if(number==x[i])
return i+1;
}
return 0;
}
void main()
{
int a[100],n,temp;
cout<<"\n Enter how many elements \n";
cin>>n;
cout<<"\n Enter "<<n<<"elements";
for(int i=0;i<n;i++)
cin>>a[i];
cout<<"\n Enter search number :";
cin>>temp;
linearsearch obj(n);
obj.input(a);
int position=obj.search(temp);
if(position!=0)
cout<<"\n Search number is present and its position:"<<position;
else
cout<<"\n search number is not present";
}
Test data
Enter how many elements
6
Enter 6 elements
23 32 11 67 33 12
Enter search number : 11
Output
Search number is present and its position : 3