#include<stdio.h>#include<stdbool.h>boolbinary_search(int arr[], int n, int k){
int left = 0;
int right = n - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (arr[mid] == k) {
returntrue;
} elseif (arr[mid] < k) {
left = mid + 1;
} else {
right = mid - 1;
}
}
returnfalse;
}
intmain(){
int arr[] = {85, 63, 52, 34, 25, 17, 6};
int n = sizeof(arr) / sizeof(arr[0]);
int k = 6;
if (binary_search(arr, n, k)) {
printf("元素 %d 存在于数组中\n", k);
} else {
printf("元素 %d 不存在于数组中\n", k);
}
return0;
}