一般法
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <Windows.h>
#include <string.h>
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;//要查找的数字
//在这个arr有序数组中查找k的下标的值
int sz = sizeof(arr) / sizeof(arr[0]);//数组的元素个数
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
{
printf("找到了,下标为:%d\n", mid);
break;
}
}
return 0;
}
函数法
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <Windows.h>
#include <string.h>
int binary_search(int a[],int k,int s)
{
int left = 0;
int right = s - 1;
while (left<=right)
{
int mid = (left + right) / 2;
if (a[mid] < k)
{
left = mid + 1;
}
else if (a[mid] > k)
{
right = mid - 1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int arr[10] = { 1,2,3,4,5,6,7,8,9,10 };
int key = 7;
int sz = sizeof(arr)/sizeof(arr[0]);
//找到了,返回下标
//找不到,返回-1
int ret = binary_search(arr, key, sz);
if (ret == -1)
{
printf("找不到了\n");
}
else
{
printf("找到了,下标是:> %d\n", ret);
}
return 0;
}