Chapter 7, Problem 63E

Program Plan Intro

Selection sort:

• The selection algorithm is used to sorts an array by continuously determining the minimum element from unordered portion and placing it at the starting position.
• The process of swapping in this sort may put one or more elements in its permanent place.
• Three steps in the selection sort algorithm are as follows:
  • Finding whether the given array is sorted or not.
  • Getting the index of the minimum value in the array.
  • Performs swapping which is used to exchange the values in the two places.

Algorithm execution flow:

• Initialize the value to the variable.
• Perform the loop until the first element is less than the length of a data array.
  • Assign the index of the first element as a small value.
  • Assign the index of the next element for the next value.
  • Perform the loop until the index value is less than the length of a data array.
    • Check each element with its next value to find a small value and set the index of small element to a variable.
  • Increment the position of index value.
  • After finding the small value, perform the swapping operation.
  • Increment the value of position.