判断整型数组a[N]是不是升序排列（递归）

升序表示越来越大 即1 2 3 4 5 6

 

#include <stdio.h>#include <stdlib.h>#include <string.h>#include <math.h>void fun(int array[], int arraySize, int index){if(arraySize == 0)//Q:此段其实只需要第一次判断，如何实现呢?{printf("数组为空!\n");return;}else if(index == (arraySize - 1) )//已经到最后一个，arraySize需-1{printf("满足升序!\n");return;}else if(array[index+1] <= array[index]){printf("不满足升序!\n");return;}elsefun(array,arraySize,++index);}int main(){int array[] = {1,3,4,7,6,9};fun(array, sizeof(array)/sizeof(array[0]), 0);return 0;}