Path: utzoo!mnetor!uunet!husc6!hao!boulder!sunybcs!rutgers!carssdf!watson
From: watson@carssdf.UUCP (John H. Watson)
Newsgroups: comp.sources.wanted
Subject: Xenix sort wanted (large buffer)
Message-ID: <173@carssdf.UUCP>
Date: 21 Dec 87 17:50:43 GMT
Organization: C.A.R.S.,Middlesex,NJ
Lines: 10
Keywords: Xenix sort

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