Selection sort is an in-place comparison-based sorting algorithm that repeatedly selects the minimum or maximum element and places it in the sorted portion of the array. In the worst case, selection sort requires nested iterations, comparing each element with the remaining unsorted portion. This results in a quadratic time complexity of O(n^2).