C++

Sorting an Array: Selection Sort Write a program that rearranges a list of values from smallest to largest using the selection sort algorithm in Display 5.7. The program should repeatedly find the next largest element in the array and move it to its final position in the sorted array. Use five functions describes in the slide 20 .You can find the details of the selection sort algorithm in EXAMPLE: Sorting an Array on page 242. You would need to rewrite the program in Display 5.8 slightly to use this alternative way of the selection sort algorithm Selection Sorting Process Example 1 Example2 29 72 9 13 752 1 3698 is langest 9 72 313 87 6 2 8 72 313 652 7 98 29 523 13 51 66 727 8 2 523 13 5 6 72 7 52 is langes 251 13 52 6 72 87 213 51 52 72 87 98 17 34 6 13 29 3 5152 66 72 87 98sorting completed