Chapter 17.1, Problem 17.2CP

Explanation of Solution

Insertion sort:

• This is sorting algorithm in which the first two elements of the array are taken and these elements are compared. If the swap is required, then it swaps the elements and places the elements in proper order.
• Now, this becomes a sorted portion of an array. Then it starts with the third element of the array and it is compared with the already sorted portion.
• This is done to insert the elements relatively in correct position according to first two elements.
• If the swap is required on comparison, then it is need to shift the elements until the third elements is placed in it correct position.
• Now, the first three elements will be in sorted manner.
• This process is continued for the fourth and subsequent elements until all of the elements are inserted into proper positions.

Example:

Consider the elements to sort (3, 6, 5, 2, 1, 4).

• The number 3 is less than 6; so no changes are made; next number 6 is greater than 5. So, number 5 is inserted in between 3 and 6.