Xref: utzoo alt.sources.wanted:1219 alt.sources.d:1701
Path: utzoo!utgpu!cs.utexas.edu!helios!samsung!sdd.hp.com!mips!pacbell.com!att!cbnewsh!wcs
From: wcs@cbnewsh.att.com (Bill Stewart 908-949-0705 erebus.att.com!wcs)
Newsgroups: alt.sources.wanted,alt.sources.d,aus.sources,aus.wanted
Subject: Re: Non memory-intensive very-large file sorter and merger needed.
Keywords: sort,sorter,wanted,merge,merger
Message-ID: <1991Apr18.225735.11037@cbnewsh.att.com>
Date: 18 Apr 91 22:57:35 GMT
References: <1991Apr16.034046.15252@phoenix.pub.uu.oz.au>
Distribution: alt
Organization: Conspiracy?  What conspiracy?
Lines: 18

In article <1991Apr16.034046.15252@phoenix.pub.uu.oz.au> proff@phoenix.pub.uu.oz.au (F. Solidus [Proff]) writes:
]    Well actually just a subroutine would do. Basiclly I need sorting
]routine that will sort data that is far larger in length than available heap
]space. The files to be sorted will be for sorting purposes the same as a
]variable-line-length text file.
	Will the UNIX "sort" program do?  It may be kind of outdated for
	modern virtual-memory systems, but it was made to solve just
	your problem and run on PDP-11s.  If you must run MS-DOS,
	get the MKS Toolkit, and use their sort.


]|Tiger! Tiger! burning bright
Didn't Blake spell it "Tyger"?
-- 
				Pray for peace;		  Bill
# Bill Stewart 908-949-0705 erebus.att.com!wcs AT&T Bell Labs 4M-312 Holmdel NJ
# Actually, it's *two* drummers, and we're not marching, we're *dancing*.
# But that's the general idea.