使用向量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 searchInsertPosition(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 left; // 返回插入位置
}

int main() {
    std::vector<int> vec = {1, 3, 5, 6};
    int target = 5;

    int index = binarySearch(vec, target);
    std::cout << "Binary Search Result: " << index << std::endl;

    int insertPos = searchInsertPosition(vec, 2);
    std::cout << "Insert Position for 2: " << insertPos << std::endl;

    return 0;
}