PE> 12 meg.  Disk space costs 50c/meg these days.

KH> Even then, I'm lucky to get 4 meg free :).. and I know Hdd's cost 50c/meg 
KH> but I still don't have the money to get it.. :)

Check out AUST_TRADING and AUST_ADS for a second hand HDD.  You can
get 120 megs for around $60 from memory (ie the "new" price for
second hand gear, with the advantage that you don't need to buy
a complete drive).

PE> You don't have a choice.  How were you planning on sorting
PE> something larger than the size of memory without having to
PE> read it into memory from disk all the time?  There may be
PE> algorithms that take that into account, I don't know.  BFN.  Paul.

KH> Multiple passing??.. I was originally thinking of a method where you read 

Multiple passing = reading the same block from the disk multiple
times = thrashing?

KH> in a block, sorta that then got the next line read the same sized block or  
KH> something like that.. I was just wondering if there was a way to do it 
KH> without using EMS/XMS..  although hopefully I should need to use  the 
KH> sorter, so I might get you to compile it for protected mode for me if you 
KH> could, because not many people run a BBS with less then 4 meg :)

This is your dupey project is it?  Where did you get the 4 meg
figure from?  Taking a guess, I would say that if someone has
a hard disk that is capable of storing 4 meg worth of data just
in the filenames, and they are running on a machine with 4 meg
or less RAM, they deserve everything they get.  BFN.  Paul.
@EOT:

---