Selection Sort is a simple sorting algorithm that works by repeatedly finding the minimum element from an unsorted portion of the list and moving it to the beginning. It divides the list into two parts: a sorted part and an unsorted part. Initially, the sorted part is empty, and the unsorted part contains all the elements. The algorithm iterates through the unsorted part, selects the smallest element, and swaps it with the first unsorted element. This process continues, gradually increasing the size of the sorted part until the entire list is sorted. Selection Sort is easy to understand and implement, but it is not the most efficient for large datasets, as its average and worst-case time complexity is O(n²).