Re: Anyone help develop an algorythm?

[NKSW39B@prodigy.com (Matthew Givens)]

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 >>