贴一发STL源码

int my_lower_bound(int size, long long key)
{
    int first = 0, middle;
    int half, len;
    len = size;
    while(len > 0) {
        half = len >> 1;
        middle = first + half;
        if(calc(middle) < key) {
            first = middle + 1;
            len = len-half-1;       //在右边子序列中查找
        }
        else
            len = half;            //在左边子序列（包含middle）中查找
    }
    return first;
}

贴一发STL源码

原文：http://www.cnblogs.com/Geek-xiyang/p/5729144.html