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-08 07:43:57 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!fr.clara.net!heighliner.fr.clara.net!proxad.net!feeder2-1.proxad.net!news1-2.free.fr!not-for-mail Newsgroups: comp.lang.ada Subject: Re: list strawman References: <7iE_7.8661$cD4.15714@www.newsranger.com> From: Jean-Marc Bourguet Date: 08 Jan 2002 16:43:53 +0100 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Message-ID: <3c3b13ba$0$212$626a54ce@news.free.fr> Organization: Guest of ProXad - France NNTP-Posting-Date: 08 Jan 2002 16:43:56 MET NNTP-Posting-Host: 158.140.208.29 X-Trace: 1010504636 news1-2.free.fr 212 158.140.208.29 X-Complaints-To: abuse@proxad.net Xref: archiver1.google.com comp.lang.ada:18649 Date: 2002-01-08T16:43:56+01:00 List-Id: Ted Dennison writes: > In article , Steven Deller > says... > >That seems to me to be a fundamental flaw in the interface. Yes, I know > >sorting is predefined in the interface, but as there is only ONE sort > >predefined, I'd think users might want to implement their own sort. > > The sort used will probably be Quicksort too (yes, I know that's not your > point). How do you do quicksort on a list? quicksort assume random access so you'll have O(n) space overhead. I'd use a merge sort on a list which would have the same complexity as quicksort and do not need random access. Yours, -- Jean-Marc