C++中的二进制搜索问题

#include <iostream>
#include <vector>

int binarySearch(const std::vector<int>& arr, int target) {
    int left = 0;
    int right = arr.size() - 1;

    while (left <= right) {
        int mid = left + (right - left) / 2;

        if (arr[mid] == target) {
            return mid;
        } else if (arr[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }

    return -1; // 目标元素不存在
}

int main() {
    std::vector<int> arr = {1, 2, 3, 4, 5, 6, 7, 8, 9};
    int target = 6;

    int result = binarySearch(arr, target);

    if (result != -1) {
        std::cout << "目标元素的索引位置为：" << result << std::endl;
    } else {
        std::cout << "目标元素不存在" << std::endl;
    }

    return 0;
}