The selection sort algorithm works by
A) repeatedly comparing adjacent items and swapping them so smaller values come before larger values
B) repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array
C) repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted
D) partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists

Question

Quizplus · Accepted Answer

The selection sort algorithm works by repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array. This process is repeated until the entire array is sorted. It does not involve comparing adjacent items or partitioning the array.

The Selection Sort Algorithm Works by