Selection Sort
In plain terms
Repeatedly selects the smallest remaining item and places it next.
Going deeper
Selection sort finds the minimum of the unsorted portion and swaps it into position, repeating until done. It's simple but slow and does few swaps.
Under the hood
Always O(n²) comparisons regardless of input; minimal swaps make it useful when writes are expensive.
Examples
Teaching, scenarios minimizing writes, tiny datasets.
Think of it like...
Like repeatedly scanning a lineup to pick the shortest person and line them up next.