Selection sort is an algorithm that sorts an array by repeatedly finding the minimum element and swapping it with the first unsorted element. It iterates through the array, finds the minimum element in the unsorted portion, and swaps it with the element in the current position. This process is repeated until the array is fully sorted.