With selection sort, we can keep track of the unsorted portion of the list and repeat the steps involved with sorting with the help of a ____ loop.
A) when
B) for
C) while
D) do

Question

Quizplus · Accepted Answer

Selection sort algorithm typically uses a for loop to iterate over the unsorted portion of the list, repeatedly selecting the smallest (or largest, depending on sorting order) element from the unsorted portion and moving it to the end of the sorted portion.

With Selection Sort, We Can Keep Track of the Unsorted