Minor re-wording in the exaplantion of sequence comparisons.

freddrake · freddrake · commit 20c94913de53 · 2001-08-01T17:17:13.000Z
This closes SF bug #445749.
diff --git a/Doc/tut/tut.tex b/Doc/tut/tut.tex
@@ -2039,9 +2039,10 @@ \section{Comparing Sequences and Other Types \label{comparing}}
 the lexicographical comparison is carried out recursively.  If all
 items of two sequences compare equal, the sequences are considered
 equal.  If one sequence is an initial sub-sequence of the other, the
-shorter sequence is the smaller one.  Lexicographical ordering for
-strings uses the \ASCII{} ordering for individual characters.  Some
-examples of comparisons between sequences with the same types:
+shorter sequence is the smaller (lesser) one.  Lexicographical
+ordering for strings uses the \ASCII{} ordering for individual
+characters.  Some examples of comparisons between sequences with the
+same types:
 
 \begin{verbatim}
 (1, 2, 3)              < (1, 2, 4)
