home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!ogicse!uwm.edu!zaphod.mps.ohio-state.edu!menudo.uh.edu!Jane.UH.EDU!LIBH
- From: libh@Jane.UH.EDU
- Newsgroups: comp.os.msdos.programmer
- Subject: Re: Sorting/Printing
- Message-ID: <1992Aug21.003819.8961@menudo.uh.edu>
- Date: 21 Aug 92 00:38:19 GMT
- Article-I.D.: menudo.1992Aug21.003819.8961
- References: <1992Aug20.022202.2349@menudo.uh.edu>,<BtA5C2.HqE@world.std.com>
- Sender: usenet@menudo.uh.edu (USENET News System)
- Reply-To: libh@Jane.UH.EDU
- Organization: University of Houston
- Lines: 18
- Nntp-Posting-Host: jane.uh.edu
-
- In article <BtA5C2.HqE@world.std.com>, jkenton@world.std.com (Jeff Kenton) writes:
- >In article <1992Aug20.022202.2349@menudo.uh.edu> libh@Jane.UH.EDU writes:
- >>
- >> I am working on a project for a friend that requires me to sort a large file
- >>of records (2000+ entries generally) that will change from month to month as he
- [deleted]
- >
- >
- >There are lots of different sorting techniques. See Knuth, Volume 3.
- >
- >Before you actually go write a serious disk sort (it will teach you
- >something worthwhile, of course) consider just sorting the new entries
- >each month and merging them into the old (sorted) file. Much quicker.
- >
- I used to have access to Knuth and read it often but someone stole it from
- the library. Also, the problem with sorting the new files and merging is that
- each month will be a seperate file that shouldn't be merged. (January,
- February, etc.....).
-