数据结构二分查找,代码可复制上机
#include"stdio.h"
int find(int *r,int n,int key)
{
int low=1,high=n,mid;
mid=(low+high)/2;
while(low<high){
if(r[mid]==key) break ;
if(r[mid]>key) high=mid-1;
else
{
low=mid+1;
}
mid=(low+high)/2;
}
return r[mid];
}
void main()
{
int r[]={0,1,2,3,4,5,6,7,8,9};
int n,b;
scanf("%d",&n);
b=find(r,9,n);
printf("%d\n",b);
}