递归方法判断数组中的元素是否有序（Java实现）

import java.util.Scanner;

class IsSort {
public int isArrayInSortedOrder(int[] a, int index) {
if (index == 1) {
return 1;
} else {
return (a[index - 1] <= a[index - 2]) ? 0 : isArrayInSortedOrder(a, index - 1);升序
}
}
}

public class Main {

public static void main(String[] args) {
// write your code here
Scanner scan = new Scanner(System.in);
int[] a = {1, 2, 3, 4, 5};
IsSort sort = new IsSort();
int res = sort.isArrayInSortedOrder(a, 5);
System.out.println(res);
}
}

以上代码是判断是否为升序，如果想判断是否为降序只要修改一处即可.

return (a[index - 1] <= a[index - 2]) ? 0 : isArrayInSortedOrder(a, index - 1);