The selection sort is continued until ______ of the n items in an array have been swapped.
A)n/2
B)n - 2
C)n - 1
D)n

Question

Quizplus · Accepted Answer

The selection sort algorithm involves finding the minimum element from the unsorted portion of the array and swapping it with the first element of the unsorted portion. This process is repeated until the entire array is sorted. In each iteration of the algorithm, one element is guaranteed to be in its final sorted position. Therefore, to sort an array of n elements, n-1 iterations are required. As a result, the selection sort is continued until n-1 of the n items in an array have been swapped.

The Selection Sort Is Continued Until ______ of the N