Question

I am stuck on trying to get this recursive function's logic to make it work.

//Write a recursive function that returns true if the sequence of 0 < n integers in A is sorted in non-increasing order and false otherwise.

iostream and cmath libraries only

bool is_sorted(const int *A, unsigned int n){
if (n == 0) return false;
if (A > A+1) return true;
else return false;
}

Answer 1

bool is_sorted(const int *A, unsigned int n){
    if (n == 1) return true;
    if (*A < *(A+1)){
        return false;
    }
    else{
        return is_sorted(A+1, n-1);
    }
}