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,start
X-Google-Attributes: gid103376,public
From: NKSW39B@prodigy.com (Matthew Givens)
Subject: Anyone help develop an algorythm?
Date: 1997/04/20
Message-ID: <5jddg7$uf0@newssvr01-int.news.prodigy.com>#1/1
X-Deja-AN: 236156158
Distribution: world
Organization: Prodigy Services Company  1-800-PRODIGY
Newsgroups: comp.lang.ada
Date: 1997-04-20T00:00:00+00:00
List-Id: <comp.lang.ada>


Okay, I have need for a special case sorting algorythm.  The best I've 
come up with is a streamlined, modified bubble sort, but performance 
isn't good enough, since I can have between 5000 and 15000 records.  
Here's the situation:

I have a linked list, each node corresponding to an array (contiguous in 
memory) of fixed length strings.  The default size of each array is 100, 
but that is user configurable and can change at run time.  So, call the 
size of the S and the length of each string in the array L.  Also, call 
the number of nodes in the linked list N.

Now, I have to sort these multiple nodes as if the whole shebang was a 
single, contiguous array.  The best I've been able to come up with is a 
modified Bubble Sort using page number as part of the looping structure.  
It looks a little weird, but it works.  Too slow, though.

This algorythm is for work, and I have to have it operational by the end 
of May.  Performance is a major consideration.

Any suggestions are appreciated.

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