From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,50880f040eb869b4
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Anyone help develop an algorythm?
Date: 1997/04/23
Message-ID: <dewar.861853014@merv>#1/1
X-Deja-AN: 237067133
References: <5jddg7$uf0@newssvr01-int.news.prodigy.com> <dewar.861594885@merv>
 <5jjthv$2an0@newssvr01-int.news.prodigy.com>
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1997-04-23T00:00:00+00:00
List-Id: <comp.lang.ada>


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.