CCSE 1322 Quiz 5 - Recursion with complete verified solutions(graded A+)

CCSE 1322 Quiz 5 - Recursion
with complete verified
solutions(graded A+)
The following recursive method takes in an array of characters, and
finds the highest letter alphabetically in the array. i.e. if passed the
following characters: x a b p s, it should return x because x is the
last of those alphabetically.
Choose the correct base condition that completes the code correctly
from the choices below.
public static char last_letter_used(char[] charArray, int position) {
//Base condition goes here
else {
if(charArray[position]>last_letter_used(charArray,position+1)) {
return charArray[position];
}
else {
return(last_letter_used(charArray,position+1));
}
}
}
options:
1. if(position==0) {
return charArray[position];
}
2. if(position==charArray.length) {
return charArray[position];
}

, 3. if(position==charArray.length-1) {
return charArray[position];
}
4. if(charArray.length==0) {
return charArray[position];
} - answer 3. if(position==charArray.length-1) {
return charArray[position];
}


Given the following method:
public static int myFunc(int x, int y) {
if(x==0) {
return y;
}
else {
return myFunc(x-1,y+1);
}
}
What is the value of x after the following call:int x = myFunc(2,4);
1. 4
2. 6
3. 8
4. Infinite recursion - answer 2. 6


This method is designed to find the lowest integer in an array.
Which of the following choices is the correct recursive call?
public static int lowest(int[] a,int start) {
if(start>=a.Length-1) {