二维数组中的查找

public class sort{
    public boolean Find(int [][] array,int target){
        int a = array.length-1;
        int i = 0;
        while(a >=0 && i<array[0].length){
            if(array[a][i]>target){
                a--;
            }else if(array[a][i]<target){
                i++;
            }else{
                return true;
            }
        }
            return false;
     }  
}