Find the Smallest, Make It Leader!
How it works: Find minimum element in unsorted part, swap it with first unsorted position.
Time Complexity: O(n²) always - must
scan remaining elements each round
Space: O(1) - In-place
Swaps: At most n-1 swaps (efficient for
memory writes)