Re: Anyone help develop an algorythm?

[NKSW39B@prodigy.com (Matthew Givens)]

dewar@merv.cs.nyu.edu (Robert Dewar) wrote:
>
>The only reasonable way to sort a list is with a two way merge sort. 
>Divide the list into equal parts, sort each sublist recurs9ively, and
>then do a 2-way merge to form the result. This sort is average and
>worst case NlogN, is easy to program, and has no disadvatanges over
>other methods that I can see.
>

The problem is that a Merge sort, if I'm not mistaken merges multiple 
arrays/files into a single sorted one.  I don't want that.  I want to 
take the mulitple arrays residing in a linked list and sort them as if 
they were a single array of data.

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