用递归算法判断数组a[N]是否为一个递增数组

 

 

/*!
* Email:
* Auth: yeah
* Date: 2019-8-25
* Brief:
* Note:
 */
#include <bits/stdc++.h>

using namespace std;
bool isArrAESC(int arr[], int size)
{
    if(size == 1) return true;
    return arr[size-2] <= arr[size-1] && isArrAESC(arr, size-1);
}
int main(int argc,char **argv){
    int arr[] = {1,7,9,10,4};
    int size = sizeof (arr)/sizeof(arr[0]);
    printf("%d\n", isArrAESC(arr, size));
    return 0;
}