Chapter 14, Problem 19RE

Explanation of Solution

Insertion sort performs significantly better than the selection sort if the array is already sorted:

• Selection sort is considered to have $\text{O}\left({\text{n}}^2\right)$ even if the array is already sorted.
• Selection sort tends to works by building a sorted prefix of the array.
• The process is done by searching for the smallest value in the suffix portion of the array to find the next value to add to the known prefix that is already sorted.
• This selection sort algorithm does not have any mechanism to determine that the assumed portion of the unsorted array is actually sorted or not.
• In the same way the assumed unsorted portion of the entire list will be searched for every iteration