小算法

1、二分搜索
auto begin=container.begin(),end=container.end();
auto mid=begin+(end-begin)/2;
while( mid!=end && *mid!=sought){
if(sought<*mid){
end=mid }
else {
begin=mid+1 }
mid = begin+(end-begin)/2
}