We use the term string to refer to a sequence of characters over some alphabet Σ. For example, Σ might be just the 26 lower-case characters of the English alphabet, the 128 characters of the standard ASCII character set, or the integers 0 through 255 (that represent all possible values of a byte). We use the term lexicographic order to denote the generalization of alphabetical order to any character set. We have already seen the sorting of fixed-length vectors as a special case of this notion (a vector can be viewed as a string where each component is a character).
KeywordsEntropy Expense Compressibility Sorting Prefix
Unable to display preview. Download preview PDF.