For the recursive method below, list the base case and the recursive statement, then show your work for solving a call to the re
cur() method using any parameter value 10 or greater.
public static int recur(int n)
{
if(n < 1)
{
return 3;
}
else
{
return recur(n / 5) + 2;
}
}
public static int recur(int n)
{
if(n < 1)
{
return 3;
}
else
{
return recur(n / 5) + 2;
}
}
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);
}