Question

Use the insertion sort to sort the list in Exercise 34, showing the list obtained at each step.

Short answer

The sorted list using insertion sort is 1,2,3,4,5,6.

Step-by-step solution

Step 1

We have to sort the list 6,2,3,1,5,4 using insertion sort

Begin with comparing first and second element in the list 6,2,3,1,5,4

here 2<6.

So 2 will be inserted before 6.

Now the list becomes 2,6,3,1,5,4.

Step 2

Now we will compare third element with first and second element (comparing 3 with 2 and 6) here 3>2 but 3<6

So 3 will be inserted before 6.

Now the list become 2,3,6,1,5,4.

Step 3

Now we will compare fourth element with first, second, third elements (comparing 1 with 2,3,6) here 1<2,1<3,1<6.

So 1 will be inserted before 2.

Now the list become 1,2,3,6,5,4.

Step 4

Now we will compare fifth element with first, second, third, fourth elements (comparing 5 with 1,2,3,6) here 5>1,5>2,5>3 but 5<6

So 5 will be inserted before 6.

Now the list become 1,2,3,5,6,4.

                                                                                                                                   

Now we will compare sixth element with first, second, third, fourth, fifth elements (comparing 4 with 1,2,3,5,6) here 4>1,4>2,4>3 but 4<5,4<6.

So 4 will be inserted before 5.

Now the list becomes 1,2,3,4,5,6.

All the elements are in ascending order.

Final answer                                                                                                                        

The sorted list using insertion sort is 1,2,3,4,5,6.