Sort the lines of the named files. Compare specified fields for each pair of lines; if no fields are specified, compare them by byte, in machine-collating sequence. If no files are specified or if the file is -, the input is taken from standard input. See also uniq, comm, and join.
Ignore leading spaces and tabs.
Check whether files are already sorted and, if so, produce no output.
Like -c, but do not report the first bad line.
Sort in dictionary order.
Fold; ignore uppercase/lowercase differences.
Sort in general numeric order.
Print a help message and then exit.
Ignore nonprinting characters (those outside ASCII range 040–176).
Skip n−1 fields and stop at m−1 fields (i.e., start sorting at the nth field, where the fields are numbered beginning with 1). If m is omitted, stop at the end of the line.
Merge already sorted input files.
Attempt to treat the first three characters as a month designation (JAN, FEB, etc.). In comparisons, treat JAN < FEB and any invalid name for a month as less than a valid month.
Sort in arithmetic order.
Put output in file.
Reverse the order of the sort.
Stabilize sort by disabling last-resort comparison.
Set the size of the ...