Selection Sort

Selection sort repeatedly finds the smallest element from an unsorted list and moves it to the beginning. It maintains sorted and unsorted subarrays, progressively sorting the list. Although simple, it is inefficient for large lists with a time complexity of O(n²).