编辑代码

#include <iostream>
#include <vector>

bool binarySearch(const std::vector<int>& arr, int k) {
    int low = 0;
    int high = arr.size() - 1;

    while (low <= high) {
        int mid = (low + high) / 2;
        if (arr[mid] == k) {
            return true;
        } else if (arr[mid] < k) {
            low = mid + 1;
        } else {
            high = mid - 1;
        }
    }

    return false;
}

int main() {
    std::vector<int> arr = {85, 63, 52, 34, 25, 17, 6};
    int k = 6;

    if (binarySearch(arr, k)) {
        std::cout << "元素 " << k << " 存在于数组中" << std::endl;
    } else {
        std::cout << "元素 " << k << " 不存在于数组中" << std::endl;
    }

    return 0;
}