Which of the following best summarizes the insertion sort algorithm?

Repeatedly insert each value in a random position.

Repeatedly insert values in a second list and then shift them into the first list.

Repeatedly insert the smallest value into a sorted sublist.

Repeatedly insert each value into its correct position in a sorted sublist.

$2$

Inserting a value in its correct position may require swapping or shifting values.

True

False

$3$

The insertion$\_$sort function uses two loops, one to scan the list and another to swap or shift values in the list.

True

False

$4$

The insertion sort algorithm only works on a list of integers.

True

False

Check My Quick Check Answers

Terms of Use