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/28 Message-ID: <5k148s$pbi@newssvr01-int.news.prodigy.com>#1/1 X-Deja-AN: 237832517 Distribution: world References: <5jddg7$uf0@newssvr01-int.news.prodigy.com> <5jjtaj$1e9e@newssvr01-int.news.prodigy.com> Organization: Prodigy Services Company 1-800-PRODIGY Newsgroups: comp.lang.ada Date: 1997-04-28T00:00:00+00:00 List-Id: 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 >>