Reference no: EM133220452

Use the Selection sort algorithm to sort the array (3, 4, 1, 5, 2) into ascending order. After the third iteration of the outer loop of the algorithm, what the result looks like? The following is the pseudocode for the Selection sort algorithm.

for (int i = 0; i < list.length - 1; i++)

// the outer loop (with the loop control variable i) is iterated
// in order to find the smallest element in the list,
// which ranges from list[i] to list[list.length-1]
{
select the smallest element in list[i..list.length-1];
// the inner loop (with the loop control variable j)
// is iterated to find the smallest element
// in in list[i..list.length-1]

swap the smallest with list[i], if necessary;

// list[i] is in its correct position.
// The next iteration applies on list[i+1..list.length-1]
}