Question

Consider the following correct implementation of the selection sort algorithm.

Answer 1

Answer:

c. 3

Explanation:

The line of code on line 19

elements[minIndex] = temp;

will run a total of 3 times in with this call to the selectionSort method. The first time it will turn the 10 in position 2 into a 30. The second time it will turn the 20 in position 4 into a 40. Finally, it will turn the newly positioned 40 in position 4 into a 50. Therefore, completely sorting the array's elements.