基本算法-二分查找

public static int binarySearch(int[] array, int des){
int low=0;
int high=array.length-1;
while (low<=high) {
int mid=(low+high)/2;
if (array[mid]==des) {
return mid;
}
else if (des<array[mid]) {
high=mid-1;
}
else {
low=mid+1;
}
}
return -1;
}