折半查找
折半查找:在一个有序数组中找一个数,找到返回下标,找不到返回-1;
个人思路:
下面我们来看看代码:
#include <stdio.h>
int search(int* a,int x,int n)
{
int begin=0;
int end=n-1;
int mid=0;
if(x<a[begin])
return -1;
if(x>a[end])
return -1;
if(x==a[begin])
return begin;
if(x==a[end])
return end;
while(begin<end-1)
{
mid=(begin+end)/2;
if(x==a[mid])
return mid;
if(x<a[mid])
end=mid;
if(x>a[mid])
begin=mid;
}
return -1;
}
int main()
{
int index=0;
int array[]={0,1,2,3,4,6,7,8,10,11,12};
index=search(array,2,sizeof(array)/sizeof(int));
printf("index=%d",index);
}