Page 126 - Data Structures Handout_Neat

10.2.2 Selection Sort

Selection Sort works by repeatedly finding the smallest (or largest) element from the

unsorted portion of the array and placing it at the beginning. It reduces the number of swaps

compared to Bubble Sort but still requires ( )⁡comparisons.
Example: Selection Sort in C++

126