Olin Lathrop wrote:
> A common way to deal with very large sorts, is to arbitrarily
> break up the large unordered pile into smaller ones that can
> each be sorted more easily. The final pass is then a merge
> of all the individual sorted piles.  This is easy and doesn't
> require much memory because each input pile and the final
> output are traversed sequentially.

   Interestingly, how does MS ADO (ActiveX Data Object)
sort records in a large recordset? Does anybody know?

   I've noticed if for some field its property "OPTIMIZE" has
been set to "True" then populating the recordset (adding
records to it) was getting slower, but "sort" method - many
times quicker. I think, ADO maintains index with every new
incoming record.

   Mike.
-------
02:40 a.m. - next instruction 00 0000 0110 0011 SLEEP

--
http://www.piclist.com hint: The list server can filter out subtopics
(like ads or off topics) for you. See http://www.piclist.com/#topics