#include<iostream>using namespace std;const int N = 6; //假定数组有N个元素 int main()
{int a[N] = {2, 4, 8, 6, 5, 3},i,key,index = -1;key = 8; //假设待查找的元素值为9for(i = 0; i < N; i++)if(a[i] == key){index = i; //找到，提前退出循环 break;}	  if(index == -1)printf("查找失败！\n");elseprintf("查找成功，元素%d在集合中的序号是%d\n",key,index);return 0;	 
}