(Choose 1 answer)
The following is the main part of insertion sort pseudocode:for i:=1 to n-1
insert a[i] into sorted sublist (a[0],...,a[i-1]}
so that the sortedness is still kept.
end for
Select the most correct solution:
Consider the list of ten integers below:
16, 5, 3, 11, 10, 8, 12, 4, 8, 6
What is the list after the FIRST TWO steps of insertion sort? (sorting from smallest to largest).
A. 3, 5, 16, 11, 10, 8, 12, 4, 8, 6
B. 3, 4, 5, 11, 10, 8, 12, 16, 8, 6
C. 3, 5, 11, 10, 8, 12, 4, 8, 6, 16
D. 3, 4, 16, 11, 10, 8, 12, 5, 8, 6
Exit 33
