如何快速实现 二分查找

详细如下文：

​​​​​​C++中自带的二分查找函数_花无凋零之时的博客-优快云博客_c++二分查找函数

#include <iostream>
#include <algorithm>

using namespace std;

int a[8] = {1, 2, 4, 4, 5, 8, 10, 22};

int main(){
    int x = lower_bound(a, a + 8, 4) - a;
    int y = upper_bound(a, a + 8, 4) - a;
    bool z = binary_search(a, a + 8, 4);
    cout<<x<<" "<<y<<" "<<z<<endl;

    x = lower_bound(a, a + 8, 7) - a;
    y = upper_bound(a, a + 8, 7) - a;
    z = binary_search(a, a + 8, 7);
    cout<<x<<" "<<y<<" "<<z<<endl;
    return 0;
}