Consider the sort method shown below for selection sort:
public static void sort(int[] a) {
For (int i = 0; i

Question

Consider the sort method shown below for selection sort:
public static void sort(int[] a) {
For (int i = 0; i < a.length - 1; i++)
{
int minPos = minimumPosition(i);
swap(minPos, i);
}
}
Suppose we modify the loop condition to read i < a.length. What would be the result?
A) An exception would occur.
B) The sort would work, but run one more iteration.
C) The sort would work but with one less iteration.
D) The sort would work exactly the same as before the code modification.

Quizplus · Accepted Answer

Changing the loop condition to i < a.length would result in an additional iteration of the loop, where the last element in the array would be compared with the second-to-last element. However, since the last element would already be in its sorted position at this point, it would not be swapped with any other elements. Therefore, the sort would work, but with one more iteration than before.

Consider the Sort Method Shown Below for Selection Sort