Research V3 development

[unix-history] / man / man1 / sort.1

.pa 1
.he 'SORT (I)'9/2/72'SORT (I)'
.ti 0
NAME            sort -- sort a file
.sp
.ti 0
SYNOPSIS        sort\b\b\b\b____ [ -\b_ ] [ input [ output ] ]
.sp
.ti 0
DESCRIPTION     sort\b\b\b\b____
will sort the input file and write the
sorted file on the output file.
If the output file is not given,
the input file is rewritten.
If the input file is missing,
sort uses the standard input as
input and the standard output for output.
Thus sort\b\b\b\b____ may be used as a filter.

The sort is line-by-line in increasing ASCII collating sequence,
except that upper-case letters are considered
the same as the lower-case letters.

The optional argument -\b_ will cause a reverse sort.

sort\b\b\b\b____ is implemented in such a way that

       sort /dev/mt0

works correctly provided the tape is not too big.
.sp
.ti 0
FILES           /tmp/stm?
.sp
.ti 0
SEE ALSO        --
.sp
.ti 0
DIAGNOSTICS     --
.sp
.ti 0
BUGS            The
largest file that can be
sorted is about 128K bytes.