c/c++ 二分查找模板

伪代码

int length = array.size();
int i = 0,j  = length - 1;
while (i <= j) {
   int middle = left + (right - left) >> 1;
   if (array[middle] == target) {
   		//break or return ;
   } else if(array[middle] > target) {
   		j = middle - 1;
   }else if (array[middle] < target) {
     	i = middle + 1;
   }
}