#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;
}
简单查找算法
最新推荐文章于 2022-05-10 22:39:24 发布