第一种:直接查找,使用了while循环和if语句
#include <stdio.h>
#include <stdlib.h>
int main()
{
int arr[] = { 1, 2,3, 4,5, 6, 7, 8, 9,};
int key = 6;
int left = 0;
int right = sizeof(arr) / sizeof(arr[0])-1;
while (left <= right)
{
int mid = (left + right) / 2;
if (key == arr[mid])
{
printf("找到了: %d\n",mid);
break;
}
else
{
if (key > arr[mid])
{
left = mid + 1;
}
else
{
right= mid - 1;
}
}
if (left > right)
{
printf("找不到:\n");
}
}
system("pause");
return 0;
}
第二种:调用了binary_search()函数,使用了while循环和if语句。注意在函数调用时传过来的数组,只是数组首元素,而不是整个数组,所以再用sizeof 时一定要注意!
#include <stdio.h>
#include <stdlib.h>
int binary_search(int arr[], int key, int sz)
{
int left = 0;
int right = sz - 1;
while (left <= right)
{
int mid = (left + right) / 2;
if (key == arr[mid])
{
return mid;
}
else
{
if (key > arr[mid])
{
left = mid + 1;
}
else
{
right = mid - 1;
}
}
}
return -1;
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9 };
int key = 8;
int sz = sizeof(arr) / sizeof(arr[0]);
int ret = binary_search(arr, key, sz);
if (ret == -1)
{
printf("找不到\n");
}
else
{
printf("找到了: %d\n", ret);
}
system("pause");
return 0;
}