watson@carssdf.UUCP (John H. Watson) (12/22/87)
Does anyone know of a public domain or cheap sort program that looks
a lot like *sort* but uses a large memory buffer. The sort program
that comes with my SCO Xenix seems to use only a 65k byte buffer.
If it could take advantage of multiple segments and use a larger buffer,
it would be much faster. This seems obvious, but I don't want to
start from scratch and write the command line parser and the compare
routines etc... Even a close approximation of the popular sort would
be helpful.
John Watson {backbone}!carssdf!watson