//二分查找法(已是有序数组)
int find(int s[],int x,int y){//x为数组长度,y为目标数
int left=0;
int right=x-1;
while(left<=right){
int mid=left+right/2;
if(s[mid]>y)
right=mid-1;
else if(s[mid]<y) left=mid+1;
else printf(找到了);return mid;
}
return -1;
}
//二分查找法(已是有序数组)
int find(int s[],int x,int y){//x为数组长度,y为目标数
int left=0;
int right=x-1;
while(left<=right){
int mid=left+right/2;
if(s[mid]>y)
right=mid-1;
else if(s[mid]<y) left=mid+1;
else printf(找到了);return mid;
}
return -1;
}