二分法查找递增数组中的值

首先是一维数组的二分法：二分法就是折半查找，从最左、最右，逐渐向目标值靠近，目标值target与数组中间值mid进行比较，target<mid，向数组的左边查找，target>mid，向数组右边查找，target==mid，返回true

    public static boolean findArray(int target,int a[]){
        int left = 0;
        int right = a.length-1;
        int mid;
        while(left <= right){
            mid = (left+right)/2;
            if(target < a[mid]){
                right = mid-1;
            }else if(target > a[mid]){
                left = mid+1;
            }else {
                return true;
            }
        }
        return false;
    }

二维数组的二分查找：将二维数组中的每个一维数组依次进行二分，

public static boolean find(int target,int a[][]){
        int rows  = a.length;
        int row = 0;
        for(row = 0; row < rows;++row){
            if(findArray(target,a[row])){
                return true;
            }
        }
        return false;
    }