home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!olivea!spool.mu.edu!umn.edu!lynx!nmsu.edu!opus!trodgers
- From: trodgers@nmsu.edu (Thomas Rodgers)
- Newsgroups: comp.lang.pascal
- Subject: Re: LARGE Sorts and such...
- Message-ID: <1993Jan4.004731.4428@nmsu.edu>
- Date: 4 Jan 93 00:47:31 GMT
- References: <1993Jan3.222248.18162@news.acns.nwu.edu>
- Sender: usenet@nmsu.edu
- Organization: NMSU Computer Science
- Lines: 26
- In-Reply-To: delusion@casbah.acns.nwu.edu's message of Sun, 3 Jan 1993 22:22:48 GMT
-
- Your best bet is a Merge sort, which is designed to sort manageable
- chunks of a very large input file. The idea is that the input is
- broken up into many small pieces, each of which is sorted, then all of
- the sorted pieces are merged back together. Any good advanced data
- structures book will have a discussion of the algorithm. A commercial
- product for TurboPascal that does this is included in Turbo Power
- Software's BTREE Filer. You might look into that if you don't feel
- inclined to write the code yourself. However, with BTREE filer, you
- might just as well put all of the records in an ISAM database and
- order them on your sort criteria and be done with it.
-
- =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
- trodgers@nmsu.edu In Real Life ???
-
- ---------------------------
- "Bob's" promise is to widen the scope and nature of *abnormal
- behavior*, to explore NEW WAYS of going over the edge *and coming
- back*. PLUS to *bring back those who couldn't on their own*...to
- help you create the HIGHEST POSSIBLE EARNINGS from the PSYCHODYNAMICS
- of ABNORMALITY...to turn Conspiracy-implanted personality disorders
- into an ILLUSION OF CREATIVITY that will *fool normals* and GET YOU
- SEX!
- --
- Excerpted from an online pamphlet for the Church Of The SubGenius
-
-
-