以下代码适用于数组且其中元素为顺序排序
int main() {
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;
int i = 0;
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", mid);
break;
}
}
if (left > right) {
printf("找不到\n");
}
return 0;
}
其中k的值可以用scanf()函数替换为自己要搜索的值