Re: WE NEED A GOOD Ada SORT PACKAGE!

[rentmei@asterix.uni-muenster.de (Jahn Rentmeister)]

Bennett, Chip (KTR) ~U (BennettC@J64.STRATCOM.AF.MIL) wrote:

: I am looking at a copy of "Software Components with Ada", the book that
: accompanies the Booch components.  Under the topic of "external sorting", it
: shows the specs for two utilities: natural merge sort and polyphase sort.  I
: believe the book is available separately.  Any help?

Maybe I don't get it right, but aren't these algorithm's designed for tape
drives? On a Disk using Direct_IO, one could for example use QuickSort.
(Because there is direct access.) There should be even faster possibilities
than a direct translation of quicksort, because one could use available RAM
to presort parts of the data. 

At least polyphase sort will work with sequential access and is bound to it. 
When using direct_io, much faster methods should be available. 
(OK, for variable-length data sets it won't work, i.e. text-files etc.)

Though, I don't know of any readily available packages that do it. But it
does not sound like a big thing to me. (I probably missed the point, eh?)

--
This .sig deliberately left empty.