顺序查找

#include <iostream>
using namespace std;
const int N=100;
//template <typename T>
class linkList
{
public:
    linkList(int a[],int n)
    {
        length=n;
        for(int i=1;i<=n;i++)
            data[i]=a[i];
    }
    int Search(int k)
    {
        int i=length;
        data[0]=k;
        while(data[i]!=k)
        {
            i--;
        }
        return i;


    }
private:
    int length;
    int data[N];


};
int main()
{
    int a[N];
    int num;
    for(int i=1;i<=5;i++)
    {
        cin>>num;
        a[i]=num;
    }
    linkList l(a,5);
    int m=l.Search(4);
    if(m==0)
        cout<<"����ʧ��"<<endl;
    else
        cout<<m<<endl;
}