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: 109fba,d275ffeffdf83655
X-Google-Attributes: gid109fba,public
X-Google-Thread: 146b77,d275ffeffdf83655
X-Google-Attributes: gid146b77,public
X-Google-Thread: 103376,d275ffeffdf83655
X-Google-Attributes: gid103376,public
X-Google-Thread: f5d71,d275ffeffdf83655
X-Google-Attributes: gidf5d71,public
From: "Fredric L. Rice" <frice@linkline.com>
Subject: Re: Ada vs C++ vs Java
Date: 1999/02/09
Message-ID: <36BF8A85.626504AE@linkline.com>#1/1
X-Deja-AN: 442242205
Content-Transfer-Encoding: 7bit
References: <369C1F31.AE5AF7EF@concentric.net>
 <tz5n2.4608$TO5.129375@ptah.visi.com> <369DDDC3.FDE09999@sea.ericsson.se>
 <369e309a.32671759@news.demon.co.uk> <77ledn$eu7$1@remarQ.com>
 <77pnqc$cgi$1@newnews.global.net.uk> <m3ww2mgzmj.fsf@mheaney.ni.net>
 <8p64spq5lo5.fsf@Eng.Sun.COM> <77t3ld$nou$1@nnrp1.dejanews.com>
 <79ce4s$lfq$1@nnrp1.dejanews.com> <79chc7$ko6@drn.newsguy.com>
 <79dodb$rhf$1@nnrp1.dejanews.com> <umqbtj9m636.fsf@maestro.clustra.com>
 <79fm3e$ffs$1@nnrp1.dejanews.com> <79fnce$iv8@drn.newsguy.com>
 <79grbs$d5u$1@nnrp1.dejanews.com>
X-Accept-Language: en
Content-Type: text/plain; charset=us-ascii
Organization: The Skeptic Tank
MIME-Version: 1.0
Newsgroups: comp.lang.ada,comp.lang.c++,comp.vxworks,comp.lang.java
Date: 1999-02-09T00:00:00+00:00
List-Id: <comp.lang.ada>

robert_dewar@my-dejanews.com wrote:

> For example, should a sort routine be standardized?
> Probably not, there are so many different algorithms, and
> different algorithms are appropriate for different
> purposes, and this very much seems to me to be the sort
> of thing that is better handled by external libraries
> (which could of course be standardized if that seemed
> desirable).

In the C and C++ world, sorts _are_ indeed standardized in some ways.
There is a standard library function called qsort() which takes as an
argument
a pointer to the "payload" function which performs the actual compares of
the
data elements being considered in the sort.

In the APL world, monadic or diadic elements are extracted from the array
or matrix using an index but the sort symbol is standard.

Knowing squat about Ada at this point, isn't there something like that in
Ada?