算法典中典1:二分查找
要求编写代码在一个整形有序数组中查找具体的某个数 找到了就打印数字所在的下标,找不到则输出:找不到。
#include<stdio.h>
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int k = 5;
int sz = sizeof(arr) / sizeof(arr[0]);//计算数组中元素个数
int left = 0;//数组最左边数的下标
int right = sz - 1;//数组最右边数的下标
while (left <= right)//防止交叉
{
int mid = (left + right) / 2;//mid是中间数的下标
if (arr[mid] > k)
{
right = mid - 1;//中间数在k右边,查找范围变为最左边的数和中间数前一个数之间
}
else if (arr[mid] < k)
{
left = mid + 1;//中间数在K左边,查找范围变为中间数后一个数与最右边的数之间
}
else
{
printf("找到了,下标是:%d\n", mid);
break;
}
}
if (left > right)//左大于右,即交叉
{
printf("找不到!\n");
}
return 0;
}
优化算法:
int mid = left + ((right - left) >> 1);代替int mid = (left + right) / 2;防止超出整型数据溢出
#include<stdio.h>
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int k = 5;
int sz = sizeof(arr) / sizeof(arr[0]);
int left = 0;
int right = sz - 1;
while (left <= right)
{
//int mid = (left + right) / 2;
//以防left + right整型溢出
//int mid = left + (right - left) / 2;
//为了速度更快,采用位运算
int mid = left + ((right - left) >> 1);
if (arr[mid] > k)
{
right = mid - 1;
}
else if (arr[mid] < k)
{
left = mid + 1;
}
else
{
printf("找到了,下标是:%d\n", mid);
break;
}
}
if (left > right)//左大于右,即交叉
{
printf("找不到!\n");
}
return 0;
}