The following incomplete method is intended to sort its array parameter arr in increasing order.
// postcondition: arr is sorted in increasing order
public static void sortArray(int[] arr)
{
int j, k;
for (j = arr.length - 1; j > 0; j--)
{
int pos = j;
for ( /* missing code */ )
{
if (arr[k] > arr[pos])
{
pos = k;
}
}
swap(arr, j, pos);
}
}
Assume that swap(arr, j, pos) exchange the values of arr[j] and arr[pos]. Which of the following could be used to replace /* missing code */ so that executing the code segment sorts the values in array arr?
A) k = j - 1; k > 0; k--
B) k = j - 1; k >= 0; k--
C) k = 1; k < arr.length; k++
D) k = 1; k > arr.length; k++
E) k = 0; k <= arr.length; k++