java实现二分查找

从小到大，只能针对有序

public static int binarysearch(int[] a,int value){
    int low = 0;
    int high = a.length - 1;
    int mid;
	while(low <=high){
    mid = (low + high)>>1;
    if(a[mid]==value){ return mid; }
    else if(a[mid]>value){ high=mid-1; }
    else  {  low=mid+1; } 
     }
     return -1;}
public static void main(String[] args) {
 int[] a = {0,1,2,3,5,7,6,9,10,11};
    System.out.println(binarysearch(a,9));
}