Which of the following completes the selection sort method minimumPosition() ? private static int minimumPosition(int[] a, int from)
{
Int minPos = from;
For (int i = from + 1; i < a.length; i++)
{
________________
}
Return minPos;
}

Question

Which of the following completes the selection sort method minimumPosition()? private static int minimumPosition(int[] a, int from)
{
Int minPos = from;
For (int i = from + 1; i < a.length; i++)
{
________________
}
Return minPos;
}
A) if (a[i] > a[minPos]) { minPos = i; }
B) if (a[i] < a[minPos]) { minPos = i; }
C) if (a[i] < a[j]) { minPos = i; }
D) if (a[i] < a[minPos]) { i = minPos; }

Quizplus · Accepted Answer

The selection sort algorithm finds the minimum element in the unsorted portion of the array. The correct condition is to update minPos when a[i] is less than a[minPos].

Which of the Following Completes the Selection Sort Method MinimumPosition()