# 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.