Consider the minimumPosition method from the SelectionSorter class.Complete the code to write a maximumPosition method that returns the index of the largest element in the range from index from to the end of the array. A)if(a[i] == a[maxPos]) { maxPos = i; } B)if(a[i] a[maxPos]) { maxPos = i; } D)if(a[i]

Question

Consider the minimumPosition method from the SelectionSorter class.Complete the code to write a maximumPosition method that returns the index of the largest element in the range from index from to the end of the array.  
A)if(a[i] == a[maxPos]) { maxPos = i; } 
B)if(a[i] <= a[maxPos]) { maxPos = i; } 
C)if(a[i] > a[maxPos]) { maxPos = i; } 
D)if(a[i] < a[maxPos]) { maxPos = i; }

Quizplus · Accepted Answer

To find the maximum position, we need to look for the largest element in the range. If we encounter an element that is greater than the current maximum element, we update the maximum position. Therefore, we need to use ">" comparison operator instead of "<=" used in the minimumPosition method. Hence, option C is the correct choice.

Consider the MinimumPosition Method from the SelectionSorter Class