In a(n) ____, a list is sorted by selecting elements in the list, one at a time, and moving them to their proper positions.
A) quicksort
B) insertion sort
C) selection sort
D) bubble sort

Question

Quizplus · Accepted Answer

In a selection sort algorithm, the list is sorted by repeatedly finding the minimum element (considering ascending order) from the unsorted part and moving it to the sorted part. This process selects elements one at a time and moves them to their correct positions, distinguishing it from the other sorting methods listed.

In A(n) ____, a List Is Sorted by Selecting Elements