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: fac41,9a0ff0bffdf63657
X-Google-Attributes: gidfac41,public
X-Google-Thread: f43e6,9a0ff0bffdf63657
X-Google-Attributes: gidf43e6,public
X-Google-Thread: 103376,4b06f8f15f01a568
X-Google-Attributes: gid103376,public
X-Google-Thread: 1108a1,9a0ff0bffdf63657
X-Google-Attributes: gid1108a1,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Why C++ is successful
Date: 1998/08/17
Message-ID: <dewar.903330517@merv>#1/1
X-Deja-AN: 381865185
References: <dewar.902415458@merv> <6qfhri$gs7$1@nnrp1.dejanews.com>
 <Pine.BSF.3.96.980807124210.21259B-100000@shell5.ba.best.com>
 <35cb8058.645630787@news.ne.mediaone.net> <dewar.902578088@merv>
 <slrn6sopmg.4fg.jdege@jdege.visi.com> <rfzpddz3s2.fsf@bnp-eng.remcomp.com>
 <902934874.2099.0.nnrp-10.c246a717@news.demon.co.uk> <dewar.903074236@merv>
 <6r1e1a$mj$1@platane.wanadoo.fr> <6r1kt7$66g$1@hirame.wwa.com>
 <dewar.903279398@merv> <nIGB1.297$pW2.1481610@news1.atlantic.net>
X-Complaints-To: usenet@news.nyu.edu
X-Trace: news.nyu.edu 903330583 1789 (None) 128.122.140.58
Organization: New York University
Newsgroups: comp.lang.eiffel,comp.object,comp.software-eng,comp.lang.ada
Date: 1998-08-17T00:00:00+00:00
List-Id: <comp.lang.ada>

Rick Smith said

<<I prefer

    sort D ascending

no flag, no goto, no exit, no loop, and no chance of using the wrong
comparison operator. It does have the overhead of a library call; but it is
always available.
>>

Sure, but that has nothing at all to do with the point I was making. Once
again, the discussoin here is not about sorting algorithms, but about how
to represent a particular algorithm!