Path: utzoo!attcan!uunet!cs.utexas.edu!tut.cis.ohio-state.edu!ucbvax!hplabs!hpl-opus!hpccc!tomj
From: tomj@hpccc.HP.COM (Tom Johnson)
Newsgroups: comp.sys.ibm.pc
Subject: SORT Bigger than memory
Message-ID: <5060058@hpccc.HP.COM>
Date: 12 May 89 21:43:36 GMT
Organization: HP Corporate Computing Center
Lines: 17

I'm trying to find a good sort algorithm (or already written code) for
the PC.  This is the oldest CS subject in existence so somebody's got
to have a good one.  The requirements are as follows:

-- If the code exists already, I'd like it an assembly language, although
   any frequently used language (one I can read) would be fine.

-- It should sort a list of "records" passed in 1 at a time.  (this isn't
   completely necessary, but it sure makes it easier to do the next thing)

-- It should be able to sort more data than memory can hold (disk swapping).

Anybody got anything?

Tom Johnson
tomj@hpccc.hp.com
415-857-7396