Java的二分查找

今天学习了二分查找，虽然代码简单，但还是要有必要，记录一下今天的学习的。

public class TestBrinarySeach {
    public static void main(String[] args) {
        int[] arr = {24,32,15,56,39,44,87,65,59};
        Arrays.sort(arr);
        
        int value = 39;//要查找的值        

        System.out.println(Arrays.toString(arr));
        System.out.println(myBrinarySeach(arr, value)+1);       
     
    }



public static int myBrinarySeach(int[] arr,int value){
        int low = 0;
        int high = arr.length-1;
        
        while(low<=high){
            int mid = (low+high)/2;
            
            if(value==arr[mid]){
                return mid;
            }
            if(value>arr[mid]){
                low = mid+1;
            }
            if(value<arr[mid]){
                high = mid-1;
            }
        }
        return -1;
    }
}