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) insertion sort
B) selection sort
C) merge sort
D) quicksort

Question

Quizplus · Accepted Answer

Insertion sort starts with an initial sequence of size 1, which is considered sorted, and then increases the size of the sorted sequence by inserting the next element into its correct position in each iteration.

Which Sort Algorithm Starts with an Initial Sequence of Size