Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!iuvax!bsu-cs!dhesi
From: dhesi@bsu-cs.bsu.edu (Rahul Dhesi)
Newsgroups: comp.unix.wizards
Subject: Re: Algorithm needed: reading/writing a large file
Message-ID: <8137@bsu-cs.bsu.edu>
Date: 7 Jul 89 17:44:49 GMT
References: <205@larry.sal.wisc.edu>
Reply-To: dhesi@bsu-cs.bsu.edu (Rahul Dhesi)
Organization: CS Dept, Ball St U, Muncie, Indiana
Lines: 12

In article <205@larry.sal.wisc.edu> jwp@larry.sal.wisc.edu (Jeffrey W
Percival) writes:
[how do I sort a large file that won't fit in memory?]

There are many variations on the merge sort.  Here is a simple one:

     break up the original file into N smaller files
     sort each smaller file
     merge them all
-- 
Rahul Dhesi <dhesi@bsu-cs.bsu.edu>
UUCP:    ...!{iuvax,pur-ee}!bsu-cs!dhesi