编辑代码

#include <iostream>
using namespace std;

bool binary_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) {
            return true; // 元素k存在于数组中
        }
        else if (arr[mid] < k) {
            left = mid + 1;
        }
        else {
            right = mid - 1;
        }
    }
    return false; // 元素k不存在于数组中
}

int main() {
    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)) {
        cout << "元素 " << k << " 存在于数组中" << endl;
    }
    else {
        cout << "元素 " << k << " 不存在于数组中" << endl;
    }
    return 0;
}