int Search(int p[],int low,int height,int key)
{
int middle=(low+height)/2;
printf("%d\n",middle);
//补充完整
if(low<=height){
if(p[middle] == key){
return middle;
}
else if(p[middle] > key){
Search(p,low,middle - 1,key);
}
else{
Search(p,middle + 1,height,key);
}
}
else{
return -1;
}
}
int main()
{
int c[10]={1,2,3,4,5,6,7,8,9,10};
int e=10;
int n=Search(c,0,9,e);
if (n!=-1)
printf(“数组中值为%d的元素下标为%d。\n”,e,n);
else
printf("%d不在数组中。\n",e);
e=100;
n=Search(c,0,9,e);
if (n!=-1)
printf(“数组中值为%d的元素下标为%d。\n”,e,n);
else
printf("%d不在数组中。\n",e);
return 0;
}