Re: Sorting in Virtual Memory

Article View: comp.sources.d

Article #732

#732

From: Binayak Banerjee
Date: Sat, 29 Aug 1992 07:36

12 lines
923 bytes

frank@D012S436.sniap.mchp.sni.de () writes:
: I'm writing a program which needs to sort a large array 
: parts of which are swapped in and out of memory (my own
: implementation of a sort of VM).
: 
[ Request for algorithm deleted ].

Check out Knuth Vol ? (Sorting and Searching).  Turn to the section on
external sorts.  This was very common in the days when core referred to
ferrite donuts threaded on wires.  Lots of algorithms.

-- Binayak

Technical Details

Message-ID: <1992Aug29.073623.15465@porthos.cc.bellcore.com>

Path: arc1-ca.pugleaf.net!sparky!uunet!walter!porthos!donuts3!bba

References: <1992Aug27.093506.11349@sniap.mchp.sni.de>

Show Full Headers

Complete Article Headers

Newsgroups: comp.sources.d,alt.sources.d
Path: arc1-ca.pugleaf.net!sparky!uunet!walter!porthos!donuts3!bba
From: bba@donuts3 (Binayak Banerjee)
Subject: Re: Sorting in Virtual Memory
Organization: Bellcore, Livingston, NJ
Date: Sat, 29 Aug 92 07:36:23 GMT
Message-ID: <1992Aug29.073623.15465@porthos.cc.bellcore.com>
X-Newsreader: Tin 1.1 PL3
References: <1992Aug27.093506.11349@sniap.mchp.sni.de>
Sender: netnews@porthos.cc.bellcore.com (USENET System Software)
Lines: 12

Reply to Parent Message