Which of the following best summarizes the insertion sort algorithm?
Repeatedly swap values inside the sorted sublist.
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 each value into its correct position.
