编辑“︁C++ 二分查找操作”︁（章节）

=== std::binary_search ===
检查目标值是否存在于已排序的范围内。

==== 语法 ====
<syntaxhighlight lang="cpp">
bool binary_search(ForwardIt first, ForwardIt last, const T& value);
bool binary_search(ForwardIt first, ForwardIt last, const T& value, Compare comp);
</syntaxhighlight>

==== 示例 ====
<syntaxhighlight lang="cpp">
#include <algorithm>
#include <vector>
#include <iostream>

int main() {
    std::vector<int> v = {1, 3, 5, 7, 9};
    
    bool found = std::binary_search(v.begin(), v.end(), 5);
    std::cout << "5 exists: " << std::boolalpha << found << '\n';  // 输出: 5 exists: true
    
    found = std::binary_search(v.begin(), v.end(), 4);
    std::cout << "4 exists: " << found << '\n';  // 输出: 4 exists: false
}
</syntaxhighlight>