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 call to the swap method call to read swap(i, minPos). What would be the result?
A) An exception would occur.
B) The sort would produce incorrect results.
C) The sort would work, but sort backwards.
D) The sort would produce correct results.

Quizplus · Accepted Answer

The sort would produce correct results.Swapping the elements at indices i and minPos ensures that the smallest element in the unsorted portion of the array is moved to the sorted portion. This process is repeated for each element in the array, resulting in a correctly sorted array.

Consider the Sort Method Shown Below for Selection Sort