#include<stdio.h>
#include<windows.h>
int binary_search(int AB[],int key,int sz)
{
int left = 0;
int right = sz-1;
while(left<=right)
{
int mid = left+(right-left)/2;
if(AB[mid]>key)
{
right=mid-1;
}
else if(AB[mid]<key)
{
left=mid+1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int AB[] = {1,2,3,4,5,6,7,8,9};
int key = 3;
int sz = sizeof(AB)/sizeof(AB[0]);
int ret = binary_search(AB,key,sz);
if(ret == -1)
{
printf("找不到!\n");
}
else
{
printf("%d\n",ret);
}
system("pause");
return 0;
}
#include<windows.h>
int binary_search(int AB[],int key,int sz)
{
int left = 0;
int right = sz-1;
while(left<=right)
{
int mid = left+(right-left)/2;
if(AB[mid]>key)
{
right=mid-1;
}
else if(AB[mid]<key)
{
left=mid+1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int AB[] = {1,2,3,4,5,6,7,8,9};
int key = 3;
int sz = sizeof(AB)/sizeof(AB[0]);
int ret = binary_search(AB,key,sz);
if(ret == -1)
{
printf("找不到!\n");
}
else
{
printf("%d\n",ret);
}
system("pause");
return 0;
}