关于二分查找代码
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
int main() {
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 0;
scanf("%d", &k);
int i = 0;
int sz = sizeof(arr) / sizeof(arr[0]);
//printf("%d\n",szeof(arr));//计算数组的总大,单位是字节。
//printf("%d\n",szeof(arr[]));4
//printf("%d\n",szeof(arr)/sizeof(arr[0]));
int left = 0;
int right = sz - 1;
while (left <= right)
{
int mid = (left + right) / 2;
if (arr[mid] == k)
{
printf("找到了下标是%d\n",mid);
break;
}
else if (arr[mid] < k)
{
left = mid + 1;
}
else {
right = mid - 1;
}
}
return 0;
}