The basic idea of an insertion sort is that for each index position (i), find the smallest data value in the positions i through length -1, then exchange the smallest value with the value at position i. ____________________

Question

Quizplus · Accepted Answer

The basic idea described is for a selection sort, not an insertion sort. In insertion sort, elements are gradually taken from the unsorted portion and inserted into the correct position in the sorted portion.

The Basic Idea of an Insertion Sort Is That for Each