of elements xj in S. Then the ordering relation < over such n-tuples can be defined so that (x1,…,xn) < (y1,…,yn)
iff x1 < y1 or there is some k, 1 ← k ← n, for which xi = yi for 1 ← i < k xk < yk
The set T is in lexicographic order if the n-tuples are sorted with respect to this relation. The concept can be extended to strings whose lengths may be different. The order would then be that in which words are placed in a dictionary.
"lexicographic order." A Dictionary of Computing. . Encyclopedia.com. (December 13, 2018). https://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/lexicographic-order
"lexicographic order." A Dictionary of Computing. . Retrieved December 13, 2018 from Encyclopedia.com: https://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/lexicographic-order