Computer Science - Algorithms - Selection sort - Selection Sort Algorithm

4 steps. Step 1 'How It Works': Find the minimum in the unsorted portion. Swap it with the first unsorted element. The sorted portion grows by one each time. Repeat until everything is sorted. Step 2 'Walkthrough': [64, 25, 12, 22, 11]. Pass 1: min=11 at index 4, swap with index 0 → [11, 25, 12, 22,