Selection Sort repeatedly finds the minimum element from the unsorted portion and places it at the beginning, building the sorted array step-by-step.
Finds the minimum element in each pass
In-place sorting with no extra memory
Unstable due to long-distance swaps
Non-adaptive, always O(n²) comparisons
Best for small datasets or educational purposes due to its simplicity