The insertion sort algorithm works by
A) repeatedly comparing adjacent items and swapping them so smaller values come before larger values
B) repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array
C) repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted
D) partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists

Question

Quizplus · Accepted Answer

The insertion sort algorithm works by repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted. It does this by comparing the value to be inserted with the values in the sorted portion of the array and shifting them over to make room for the new value. This process is repeated until all values are in their correct position, resulting in a sorted array.

The Insertion Sort Algorithm Works by