Scribe日志收集系统的安装

public static int binarySearch(int[] array,int value){
int low = 0;
int high = array.length - 1 ;
int middle = 0;

while(low <= high){
midddle = (low +high)/2;
if(array[midddle]== value){
return midddle;
}
if(value < array[midddle]){
high = middle -1;

}
if(value > array[midddle]){
low = middle +1;
}
}

return -1;

}