给定一个整型数组, 判定数组是否有序(递增)
public class Test39 {
public static void main(String[] args) {
int[] arr={1,2,3,4,5,6};
int[] arr2={1,3,2,4,5,6};
isOrd(arr);
isOrd(arr2);
}
private static void isOrd(int[] arr) {
boolean ret=false;
for (int i = 0; i < arr.length-1; i++) {
if(arr[i]>arr[i+1]){
ret=true;
}
}
if(ret==false){
System.out.println("此数组有序");
}else{
System.out.println("此数组无序");
}
}
}
实现结果: