Re: Anyone help develop an algorythm?

[dewar@merv.cs.nyu.edu (Robert Dewar)]

Matthew Givens says

<<Now, I know a bit about heap, and it seems to require contiguous storage,
t do it's thing.  As do most sorting algorythms.  I need one that can
accomodate the difference.>>

Please look at g-hesora.ads in the GNAT library. It has a purely
procedural interface that does not require contiguous data, it just
requires a linear indexing access path, which certainly does not
require contiguous data (for example, set up an index vector, or
you could even use a two level structure for indexing (in theory
that might make the sort N logN logN, but in practice it would
just introduce a small extra constant factor.