使用递归判断一个数组是否为升序

/**
* 递归判断数组是否升序
* */
public class IsAccendListRecursive {
public static void main(String args[]){
IsAccendListRecursive is = new IsAccendListRecursive();
int[][] a={
{1,2,3,4,5,6,7},
{8,2,3,4,5,6,7},
{1,2,3,8,5,6,7},
{1,2,3,4,5,6,0},
};
for(int[] n:a){
is.is(n,0,n.length-1);
System.out.println(is.flag);
}
}
private boolean flag;
public int is(int[] n,int s,int e){
if(s==e){
flag = true;
}else{
int min = is(n,s+1,e);
flag = flag&&(n[s]<min);
}
return n[s];
}
}