Assuming a method
Int findMax(int array[ ],int last)that returns the subscript of the largest value in the portion of an array whose elements are at 0 through last (inclusive),a recursive method for sorting in ascending order a portion of an array between 0 and last,inclusive,can be written as follows:
Void rSort(int array[ ],int last){
If (last = 1){
// Missing code
}
}
If a method
Void swap(int array[ ],int pos1,int pos2)can be used to swap the contents of two array entries,then the logic for the missing code is
A) findMax(array,array.length-1);rSort(array,array.length-1);
B) int p = findMax(array,array.length-1.;rSort(array,p.;
C) int p = findMax(array,last.;swap(array,p,last.;rSort(array,last-1.;
D) rSort(array,last-1.;int p = findMax(array,last.;swap(array,p,last.;

Question

Assuming a method
Int findMax(int array[ ],int last)that returns the subscript of the largest value in the portion of an array whose elements are at 0 through last (inclusive),a recursive method for sorting in ascending order a portion of an array between 0 and last,inclusive,can be written as follows:
Void rSort(int array[ ],int last){
If (last >= 1){
// Missing code
}
}
If a method
Void swap(int array[ ],int pos1,int pos2)can be used to swap the contents of two array entries,then the logic for the missing code is
A) findMax(array,array.length-1);rSort(array,array.length-1);
B) int p = findMax(array,array.length-1.;rSort(array,p.;
C) int p = findMax(array,last.;swap(array,p,last.;rSort(array,last-1.;
D) rSort(array,last-1.;int p = findMax(array,last.;swap(array,p,last.;

Quizplus · Accepted Answer

The missing code needs to find the position of the largest value in the portion of the array being sorted and swap it with the element at the last position. This ensures that the largest value is in its correct position at the end of the sorted portion. The position of the largest value can be found using the findMax() method with the last parameter set to the current value of last. This position is then stored in variable p and used to swap the values at positions p and last using the swap() method. Finally, rSort() is recursively called with a reduced last value of last-1 to sort the remaining portion of the array.

Assuming a Method Int FindMax(int Array[ ],Int Last)that Returns the Subscript of the Subscript