Summary

selection_sort repeatedly finds the smallest element in the unsorted part and swaps it into the current index. It scans left to right until all positions are fixed. It is in_place and a comparison_sort. Time is time_complexity_O_n2 and space is space_complexity_O_1. It performs few swaps, about n-1. It is usually unstable. No early stopping on already sorted input. Useful for small arrays and learning. Core actions to recall: select_min, locate index, swap, move to next position.