Answer:
The function in C++ is as follows:
int isSorted(int ar[], int n){
if (
|| 
){
return 1;}
if (![ar[n - 1]](https://tex.z-dn.net/?f=ar%5Bn%20-%201%5D)
< ![ar[n - 2]](https://tex.z-dn.net/?f=ar%5Bn%20-%202%5D)
){
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);
}
no longer returns an error but your math seems to have something wrong with it, always returns 0
Console.WriteLine("Enter a percentage here");
int Percent = int.Parse(Console.ReadLine());
Console.WriteLine("Enter your number here");
int Number = int.Parse(Console.ReadLine());
int result = Percent / 100 * Number;
Show us a picture so we can answer
Answer:
A. The parent-teacher orginization keeps a log of cookies sales to raise money for the elementary school.
Explanation:
Answer:
see attached picture
Explanation:
An algorithm would be:
if hours < 10 then bonus = 0
else if hours <= 15 then bonus = 1000
else if hours <= 20 then bonus = 1500
else if hours <= 25 then bonus = 2000
else if hours <= 30 then bonus = 3000
else bonus = 5000
