簡單查找算法

#include<iostream>
using namespace std;
#define Maxsize 100
typedef struct{
    int list[Maxsize];
    int length;
}Table;
int SeqSearch(Table S,int x)
{
    int i=0;
    while (i<S.length&&S.list[i]!=x)
    i++;
    if(S.list[i]==x)
    return i+1;
    else return 0;
}
int main(){
    Table T={{78,34,21,33,12,36,76,32},8};
    int i,position,x;
    cout<<"表中的元素："<<endl;
    for(i=0;i<T.list[i];i++)
    cout<<T.list[i]<<" "; 
    cout<<endl;
    cout<<"請輸入你要查找的數：";
    cin>>x;
    position=SeqSearch(T,x);
    if (position)
    cout<<x<<"是表的第"<<position<<"個元素"<<endl;
    else cout<<"error"<<endl;
    return 0;    
}