二分法适用于在一批有序的数列中查找某数;
#include<stdio.h>
int main()
{
int a[10]={-12,0,6,23,56,80,100,110,115};
int n, low, mid, high, found;
low=0;
high=9;
found=0;
scanf("%d",&n);
while(low<=high)
{
mid=(low+high)/2;
if(n==a[mid])
{
found = 1; break;
}
else if(n>a[mid])
{
low=mid;
}
else
{
high=mid;
}
}
if(found==1)
{
printf("The index of%dis%d",n,mid);
}
else
{
printf("There is not %d",n);
}
}