What does each iteration of the insertion sort algorithm do?
A)Each iteration takes the next smallest element and inserts it at the beginning of the array.
B)Each iteration takes the next element in the unsorted portion of the array and inserts it into the sorted portion.
C)Sorted subarrays are inserted into the larger array.
D)Each iteration determines the location of a pivot and inserts it into place.

Question

Quizplus · Accepted Answer

In each iteration of the insertion sort algorithm, the next element in the unsorted portion of the array is taken and inserted into the sorted portion by comparing it with the elements in the sorted portion and shifting them to make space for the new element in the correct place. This process is repeated until all elements are sorted.

What Does Each Iteration of the Insertion Sort Algorithm Do