Chapter 16.1, Problem 16.3CP

Explanation of Solution

Selection sort:

• This is sorting algorithm in which it finds out the smallest value in the array and moves that element to position “0”.
• Then, it finds out the next smallest value and moves the element to position “1”.
• This process is continued until all the elements are placed in proper order.

Example:

Consider the elements to sort (8, 5, 1, 2, 7 )

• Find the smallest element in the array by comparing all the values and place it in the first position.

• Find the next smallest element in the array by comparing the values and place it in second position.