Which sort algorithm starts with an initial sequence of size 1, which is assumed to be sorted, and increases the size of the sorted sequence in the array in each iteration?
A)selection sort
B)quicksort
C)merge sort
D)insertion sort

Question

Quizplus · Accepted Answer

This is the typical algorithm description for insertion sort. It starts with an assumption that the first element is sorted, and then for each element, it compares it to the elements before it in the already sorted sequence, and inserts it in the correct position. As the sorted sequence grows, the unsorted sequence shrinks until there are no more unsorted elements left. Insertion sort has a time complexity of O(n^2) but can perform well on small input sizes or partially sorted sequences.

Which Sort Algorithm Starts with an Initial Sequence of Size