The following represents the algorithm for ____ sort.
For each array element from the second (nextPos = 1) to the last
Insert the element at nextPos where it belongs in the array, increasing
The length of the sorted subarray by 1 element.
A) merge
B) shell
C) selection
D) insertion

Question

Quizplus · Accepted Answer

The described algorithm is for insertion sort. It iterates through the array, inserting each new element into the correct position within the already sorted section of the array, thereby expanding the sorted section by one element with each iteration.

The Following Represents the Algorithm for ____ Sort