List the steps that the insertion sort algorithm would make in sorting the values 4, 1, 3, 2.

The Insertion Algorithm will loop through the values given and move certain values back until the final array is sorted.

Explanation:

Insertion Algorithms start with the second value in a set.

Initial set:  4, 1, 3, 2

Step 1:  1 is lower than 4 so it is moved behind 4 and 4-2 are pushed forward by one 1, 4, 3, 2

Step 2: 3 is lower than 4 but higher than 1 so it is moved behind 4 and 4 and 2 are pushed forward by one 1, 3, 4, 2

Step 3: 2 is lower than 4 and lower than 3 but higher than 1 so it is moved behind 3, and 3-4 are pushed forward by one 1, 2, 3, 4

The Set is now Sorted and the Insertion Algorithm is finished.

I hope this answered your question. If you have any more questions feel free to ask away at

add the following