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

Each iteration of the insertion sort algorithm takes the next element in the unsorted portion of the array and inserts it into the sorted portion by finding its appropriate location in the sorted subarray. This process is repeated until the entire array is sorted.

What Does Each Iteration of the Insertion Sort Algorithm Do