1、用二分法查找数组[1,2,3,4,5,6,7,8,9,10]中数字7。
int main()
{
int k=7;
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int left = 0;
int sz = sizeof(arr) / sizeof(arr[0]);
int right = sz - 1;
while (left <= right)
{
int mid = (left + right) / 2;
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;
}
2、写一个函数,实现数组[1,2,3,4,5,6,7,8,9,10]中7的位置。
//二分查找函数实现:在一个有序数组中查找具体的某个数,如果找到返回这个数的下标,找不到返回-1;
int binary_search(int arr[], int k, int sz)
{
int left = 0;//左边的下标
int right = sz - 1;
while (left <= right) //当左边的下标
{
int mid = (left + right) / 2;
if (arr[mid] < k)
{
left = mid + 1;
}
else if(arr[mid]>k)
{
right = mid - 1;
}
else
{
return mid;
}
}
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;//K为要找的数字
int sz = sizeof(arr) / sizeof(arr[0]);
int ret = binary_search(arr, k, sz);//用ret存储找到数字的下标
if (ret == -1)
{
printf("找不到指定的数字\n");
}
else
{
printf("找到了,下标是:%d\n", ret);
}
return 0;
}
结果: