//顺序查找
//常见的查找算法有两种:
//顺序查找和折半查找(又称二分查找)
//对没有排序的数据用顺序查找(简单但速度慢)
//对已排序的数据用二分查找
#include <iostream>
using namespace std;
int SequentialSearch(int *list,const int n,const int x);
int main()
{
int a[]={2,4,6,8,0,1,3,5,7,9};
int num=5,result;
result=SequentialSearch(a,10,num);
if(result==-1)//或者if(result<0)
cout<<"没有找到"<<endl;
else
cout<<"在a["<<result<<"]找到"<<num<<endl;
return 0;
}
int SequentialSearch(int *list,const int n,const int x)
{
int i;
for(i=0;i<n;i++)
if(list[i]==x)return i;
if(i==n)return -1;
}