Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 9/5/84; site yetti.UUCP Path: utzoo!utcs!mnetor!yetti!mike From: mike@yetti.UUCP (Mike Clarkson ) Newsgroups: fa.info-vax Subject: Re: sort makes big working files Message-ID: <272@yetti.UUCP> Date: Mon, 28-Oct-85 12:39:21 EST Article-I.D.: yetti.272 Posted: Mon Oct 28 12:39:21 1985 Date-Received: Mon, 28-Oct-85 15:39:21 EST References: <4594@cca.UUCP> Reply-To: mike@yetti.UUCP (Mike Clarkson ) Organization: York University Computer Science Lines: 13 Keywords: VMS SORT, VMS MERGE Summary: Use SORT then MERGE Almost all sort algorithms use geometrically increasing space (and time) to sort a file. Although the sizes of the files created seem huge, they may be correct. The simple way around this is to break the large file into say 10 smaller files and SORT them individually, and then use MERGE to take the 10 sorted small files, and create your final sorted file. {decvax|inhp4|linus|watmath}!utzoo!yetti!mike -- Mike Clarkson, ...!allegra \ BITNET: FS300013@YUSOL CRESS, York University, ...!decvax \ 4700 Keele Street, ...!ihnp4 > !utzoo!yetti!mike North York, Ontario, ...!linus / CANADA M3J 1P3. ...!watmath / AT&T^G: (416) 667-3954