二分查找法

     // 二分查找法；
    public static int binarySearch(int[] arr, int x){
        int low = 0;
        int high = arr.length-1;
        while(low <= high){
            int middle = (low + high)/2;
            if(x == arr[middle]){
                return middle;
            }else if(x < arr[middle]){
                high = high -1;
            }else{
                low = middle+1;
            }
        }
        return -1;
    }
    // 测试
    public static void main(String[] args) {
        int[] arr = {1,4,6,7,9,13,15,76,333};
        System.out.println(binarySearch(arr,333));
    }