Question

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

Short answer

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

Step-by-step solution

Step 1

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

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

here 1<3.

So 1 will be inserted before 3.

Now the list becomes 1,3,5,7,4.

Step 2

Now we will compare third element with first and second element (comparing 5 with 3 and 1) here 5>3 and 5>1

no interchange required

Now the list becomes 1,3,5,7,4.

Step 3

Now we will compare fourth element with first, second, third elements (comparing 7 with 3,1,5) here 7>3 ,7>1,7>5

no interchange required.

Now the list becomes 1,3,5,7,4.

Step 4

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

So 4 will be inserted before 5.

Now the list becomes 1,3,4,5,7.

All the elements are in ascending order.

Final answer                                                                                                                        

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