Subj : Re: Sorting
To   : borland.public.cpp.borlandcpp
From : "Dwayne" <myfrienddr@yahoo.com>
Date : Tue Dec 16 2003 11:34 am

        Hello Nokomis,

Nokomis>>Something like a telephone direcctory - too big for a normal array.

    Well, a cheap simple way to do so, would be to hash the file.  Build a
tree, and as you
read through the file once, your tree is built, and presto...instant
sorting.  I built a Btree that
works directly off your hard drive... thus you have unlimited amount of
memory (except your hard
drive space).   It works wonderfully and is extremely fast.  At times, I
will sort 2 to 8 million things at once.

                     Dwayne

.