Subj : Re: Sorting
To   : borland.public.cpp.borlandcpp
From : Nokomis <nokomis@radiolink.net>
Date : Wed Dec 17 2003 05:37 pm



Dwayne wrote:

>         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

Dwayne,

That sound wonderful but could you be alitle more explanatory to a relative
beginner!  For example, what's a BTree ?

Thanks

Georges

.