编辑“︁C++ 随机访问迭代器”︁（章节）

=== 二分查找实现 ===
随机访问迭代器的高效跳转能力使其成为实现算法如二分查找的理想选择：

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

bool binary_search(std::vector<int>::iterator first, 
                  std::vector<int>::iterator last, int value) {
    auto count = last - first;
    while (count > 0) {
        auto it = first;
        auto step = count / 2;
        it += step;
        
        if (*it < value) {
            first = ++it;
            count -= step + 1;
        } else if (*it > value) {
            count = step;
        } else {
            return true;
        }
    }
    return false;
}

int main() {
    std::vector<int> data = {1, 3, 5, 7, 9, 11};
    std::cout << std::boolalpha;
    std::cout << "Found 5: " << binary_search(data.begin(), data.end(), 5) << "\n";
    std::cout << "Found 6: " << binary_search(data.begin(), data.end(), 6) << "\n";
    return 0;
}
</syntaxhighlight>

输出：
<pre>
Found 5: true
Found 6: false
</pre>