二分查找

public class BinarySearch{public static int BSearch(int[] array,int value){//查找数组array中是否含有value值的元素，                                                  //找到则返回下标，找不到则返回-1int low = 0;int high = array.length-1;int middle;while(low<=high){middle = (low + high)/2;if (array[middle] == value){return middle;}if(value < array[middle]){high = middle - 1;}if (value > middle){low = middle + 1;}}   return -1;}public static void main(String[] args){int[] array = {1,2,3,4,5,6,7,8,9,10,11,12,13};System.out.println(BSearch(array,8));}}