What statement accurately describes the strategy utilized by the insertion sort algorithm?
A) The insertion sort algorithm repeatedly swaps elements that are out of order in a list until they are completely sorted.
B) The insertion sort algorithm repeatedly swaps the smallest element in an unsorted portion of a list with an element at the start of the unsorted portion.
C) The insertion sort algorithm repeatedly inserts the i-th element into its proper place in the first i items in the list.
D) The insertion sort algorithm partitions a list around a pivot item and sorts the resulting sublists.

Question

Quizplus · Accepted Answer

The insertion sort algorithm repeatedly inserts the i-th element into its proper place in the first i items in the list. This is done by comparing each element to its previous neighbor and inserting it in the correct position in the already sorted list.

What Statement Accurately Describes the Strategy Utilized by the Insertion