# Sorting Sequences of Strings

## Input

An ordered sequence $S$ of length $n \in \mathbb{N}_{0}$ and component type "string over some alphabet $\Sigma$."

## Output

A permutation of $S$ such that, for $i \in \{1,...,n-1\}$, $S[i]$ is not lexicographically larger than $S[i+1]$.

N/A

## Complexity

Linear in the total sum of all string lengths.

## Known algorithms

1. Bucketsort
2. Bubblesort (solves the generic sorting problem)
3. Mergesort (solves the generic sorting problem)
4. Quicksort (solves the generic sorting problem)
5. Selection sort (solves the generic sorting problem)