Answer:
Following is given the solution to each part.
All the comments are given above each step so that they can make the logic clear.
I hope it will help you!
Explanation:
Simplify the expresion12. 12g + 9g
1 answer:
You might be interested in
Answer:
Here the code is given as follows,
Explanation:
Code:-
#include <stdio.h>
int isSorted(int *array, int n) {
if (n <= 1) {
return 1;
} else {
return isSorted(array, n-1) && array[n-2] <= array[n-1];
}
}
int main() {
int arr1[] = {3, 6, 7, 7, 12}, size1 = 5;
int arr2[] = {3, 4, 9, 8}, size2 = 4;
printf("%d\n", isSorted(arr1, size1));
printf("%d\n", isSorted(arr2, size2));
return 0;
}
Output:-
The answer & explanation for this question is given in the attachment below.
