25 pts! If programmers cannot write an algorithm because the problem is too complex, which methodology can they use to reach an
1 answer:
You might be interested in
Answer:
The function in C++ is as follows:
int isSorted(int ar[], int n){
if ( ||
){
return 1;}
if ( <
){
return 0;}
return isSorted(ar, n - 1);}
Explanation:
This defines the function
int isSorted(int ar[], int n){
This represents the base case; n = 1 or 0 will return 1 (i.e. the array is sorted)
if ( ||
){
return 1;}
This checks if the current element is less than the previous array element; If yes, the array is not sorted
if ( <
){
return 0;}
This calls the function, recursively
return isSorted(ar, n - 1);
}