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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,cda33fc7f63c2885
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-01-14 08:31:24 PST
Path: 
 archiver1.google.com!news2.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed00.sul.t-online.de!t-online.de!fr.usenet-edu.net!usenet-edu.net!proxad.net!feeder2-1.proxad.net!news2-2.free.fr!not-for-mail
Newsgroups: comp.lang.ada
Subject: Re: list strawman
References: <mailman.1010451062.16465.comp.lang.ada@ada.eu.org>
 <7iE_7.8661$cD4.15714@www.newsranger.com>
 <3c3b13ba$0$212$626a54ce@news.free.fr>
 <sHF_7.8807$cD4.16831@www.newsranger.com>
 <3c3b2aa0$0$212$626a54ce@news.free.fr>
 <zwH_7.9026$cD4.17983@www.newsranger.com>
 <3c3bfabc$0$3190$626a54ce@news.free.fr>
 <4519e058.0201091037.325fbdbb@posting.google.com>
 <3c3eb272$0$282$626a54ce@news.free.fr> <3C3F1A0F.2000706@telepath.com>
 <7uir1a.s11.ln@192.168.0.2> <4519e058.0201140802.678399db@posting.google.com>
From: Jean-Marc Bourguet <jm@bourguet.org>
Date: 14 Jan 2002 17:22:02 +0100
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Message-ID: <3c4305ae$0$210$626a54ce@news.free.fr>
Organization: Guest of ProXad - France
NNTP-Posting-Date: 14 Jan 2002 17:22:06 MET
NNTP-Posting-Host: 158.140.208.29
X-Trace: 1011025326 news2-2.free.fr 210 158.140.208.29
X-Complaints-To: abuse@proxad.net
Xref: archiver1.google.com comp.lang.ada:18911
Date: 2002-01-14T17:22:06+01:00
List-Id: <comp.lang.ada>

dennison@telepath.com (Ted Dennison) writes:

> Jean-Marc Bourguet <jm@bourguet.org> wrote in message
> news:<7uir1a.s11.ln@192.168.0.2>...
> > What I presented is algorithm L in section 5.2.4 of The Art Of
> > Computer Programming (in the third volume) modified according
> > exercise 12 of the same section.  All the ideas are also presented
> > in the section 5.4 of the same book. I don't think I'll get a
> > prize for reading Knuth and his solutions to his exercises :-)
> 
> You probably should. Not enough people do that. :-)
> 
> I wish I had a copy myself. Its been on my Xmas book list for 3
> years running, but no-one seems to want to buy me a $50 book on
> algorithms (much less a set of 3 of them). :-(

I did the same,... and ended by bying them myself :-)
 
> > More precisely, what I wrote was supposed to be that. Reading
> > Knuth anew I see one bug which modify the number of operations
> > needed to be O(N^2) on average.
> ...
> > Appended is a fixed version with a test harness.
> 
> I'm still not convinced that you have a mergesort solution here that
> is O(n) for sorted lists, as was advertised.

For sorted list, Merge is never run.  And Split is O(n).

-- 
Jean-Marc