Selection Sort
Domain: Algorithms
🎯 Motivation
Find the smallest element, put it first, then find the next smallest, put it second, and so on. Simple but always O(n
📋 Concrete Example
On [5, 3, 8, 1]: find smallest (1), swap with first -> [1, 5, 8, 3]. Find next smallest (3), swap with second -> [1, 3, 8, 5]. Repeat.
🔗 Analogy
Selecting team members in PE class. The captain picks the best remaining player each round, placing them in order of selection. The team is sorted from best to worst.