二分查找虽然简单,但是很基础,笔试以及面试的命中率很高,因此再次复习,并将易混淆之处指出,以免犯错。
参考:http://blog.163.com/hjzjoy@126/blog/static/5375838320071019478271/
二分查找的非递归查找,采用while(low<=high)来控制查找的进行。
int BiSearch(int A[], int low, int high, int x)
{
while(low <= high)
{
int mid = (low + high)/2;
if(x > A[mid])
low = mid + 1;
else if(x < A[mid])
high = mid - 1;
else
return mid;
}
return -1;
}
递归实现
第一个递归是我自己实现的版本,结构和非递归差不多,但是需要在结尾加一个判断条件,将需要的下标返回。
int BiSearchNew1(int A[], int low, int high, int x)
{
int mid;
mid = (low + high)/2;
if(low <= high)
{
if(x > A[mid])
{
mid = BiSearchNew1(A, mid + 1, high, x);
}
else if(x < A[mid])
{
mid = BiSearchNew1(A, low, mid - 1, x);
}
else
return mid;
if(mid >= 0)
{
return mid;
}
}
return -1;
}
通过查阅,发现有更加方便的办法,附于下:
int BiSearchNew2(int A[], int low, int high, int x)
{
int mid;
if(low > high)
return -1;
mid = (low + high)/2;
if(x == A[mid])
return mid;
if(x < A[mid])
return BiSearchNew2(A, low, mid - 1, x);
else
return BiSearchNew2(A, mid + 1, high, x);
}
下面是测试程序:
int main()
{
int A[7] = {1, 3, 4, 6, 7, 9, 13};
int i;
int j;
for(j = 0; j < 7; j++)
{
i = BiSearch(A, 0, 6, A[j]);
printf("%d ", i);
}
printf("\n");
for(j = 0; j < 7; j++)
{
i = BiSearchNew1(A, 0, 6, A[j]);
printf("%d ", i);
}
printf("\n");
for(j = 0; j < 7; j++)
{
i = BiSearchNew2(A, 0, 6, A[j]);
printf("%d ", i);
}
printf("\n");
getch();
return 0;
}