= Selection sort
Selection sort repeatedly chooses a minimum element from the unprocessed collection and moves it to the next output position. After each step the output <string prefix> is sorted and no larger than any remaining element. Repeated linear minimum scans give quadratic worst-case time. A <linked list> implementation can detach and append existing nodes using constant auxiliary space while preserving duplicate elements. The sorted result is nondecreasing, not strictly increasing when duplicates occur.
Back to article page
