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: NKSW39B@prodigy.com (Matthew Givens)
Subject: Re: Anyone help develop an algorythm?
Date: 1997/04/23
Message-ID: <5jjthv$2an0@newssvr01-int.news.prodigy.com>#1/1
X-Deja-AN: 236710039
Distribution: world
References: <5jddg7$uf0@newssvr01-int.news.prodigy.com> <dewar.861594885@merv>
Organization: Prodigy Services Company  1-800-PRODIGY
Newsgroups: comp.lang.ada
Date: 1997-04-23T00:00:00+00:00
List-Id: <comp.lang.ada>


dewar@merv.cs.nyu.edu (Robert Dewar) wrote:
>
>Matthew says
>
>
>Ugh! bubble sort sounds, even modified as you say, sounds like a 
horrible
>choice here. Have a look at the g-hesora or g-hesorg files in the GNAT
>distribution for efficient sorts (this is a modified heapsort, using 
the
>modification i developed in my thesis work 30 years ago, which halves
>the number of comaprisons). It is setup with a procedural interface
>that should be easy to adapt to your application.
>

Guys, please.  Of course I know that the Bubble is the worst sort in 
existence for a large array, but it was the easiest to implement with the 
array divided up into non-contiguous chunks.  It works, but performance 
is unacceptable.  Basically I did it to get something working now, with 
(hopefully) a better method coming later.

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.

-
If at first you don't succeed, destroy all evidence that you ever tried. 
<< Iceman >>