#include <iostream>
#define size 10
using namespace std ;
int main()
{int search (int v[],int n,int key);
int d[size] , i , KEY ,index ;
cout << "input the d:" << endl ;
for (i=0;i<size;++i)
{ cin >> d[i] ; }
cout << "input a key you want to search:" << endl;
cin >> KEY ;
index=search(d , size , KEY);
if(index >= 0 )
cout<<"the index of the key is:"<<index<<endl;
else
cout<<"no found"<<endl;
return 0;
}
int search (int v[],int n,int key)
{int i;
for (i=0;i<n;++i)
{if ( key=v[i] )
return i;
else
return -1;}
}
转载于:https://www.cnblogs.com/bruceloo/archive/2009/06/01/1493734.html
相关资源：数据结构—成绩单生成器
