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: f5d71,d275ffeffdf83655 X-Google-Attributes: gidf5d71,public X-Google-Thread: 109fba,d275ffeffdf83655 X-Google-Attributes: gid109fba,public X-Google-Thread: 103376,d275ffeffdf83655 X-Google-Attributes: gid103376,public X-Google-Thread: 146b77,d275ffeffdf83655 X-Google-Attributes: gid146b77,public From: dennison@telepath.com Subject: Re: Ada vs C++ vs Java Date: 1999/02/08 Message-ID: <79mvba$2qi$1@nnrp1.dejanews.com>#1/1 X-Deja-AN: 441842356 References: <369C1F31.AE5AF7EF@concentric.net> <369DDDC3.FDE09999@sea.ericsson.se> <369e309a.32671759@news.demon.co.uk> <77ledn$eu7$1@remarQ.com> <77pnqc$cgi$1@newnews.global.net.uk> <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> <79fm3e$ffs$1@nnrp1.dejanews.com> <79fnce$iv8@drn.newsguy.com> <79grbs$d5u$1@nnrp1.dejanews.com> <79hujb$ck3@drn.newsguy.com> X-Http-Proxy: 1.0 x12.dejanews.com:80 (Squid/1.1.22) for client 204.48.27.130 Organization: Deja News - The Leader in Internet Discussion X-Article-Creation-Date: Mon Feb 08 15:20:19 1999 GMT Newsgroups: comp.lang.ada,comp.lang.c++,comp.vxworks,comp.lang.java X-Http-User-Agent: Mozilla/4.5 [en] (WinNT; I) Date: 1999-02-08T00:00:00+00:00 List-Id: In article <79hujb$ck3@drn.newsguy.com>, mike wrote: > In article <79grbs$d5u$1@nnrp1.dejanews.com>, robert_dewar@my-dejanews.com > says... > > > >For example, should a sort routine be standardized? > >Probably not, there are so many different algorithms, and > >different algorithms are appropriate for different > >purposes, > > But a standard sort package would only specify the interface, and > would leave the implementation up to the vendor. isn;t this how > things are supposed to be? Maybe even supply a standard interface to > a small number of class of sort API's if that is needed. (this is not > different from the unix 'sort' command for example). No. The choice of sort algorithm I want to use is highly dependent on my problem space. Some algorithms are better on nearly sorted data, some are better on completely scrambled data. Some are great for huge amounts of input items, but are not so hot for small amounts of input items. There exists one algorithm that is superior to all others when the items to be sorted are all integers. Then there's the static vs. dynamic (array vs. pointers) issue... I don't see how a compiler vender is going to have any better clue which one I need than a language standard writer would. The only person really capable of making the decision is the developer in question. T.E.D. -----------== Posted via Deja News, The Discussion Network ==---------- http://www.dejanews.com/ Search, Read, Discuss, or Start Your Own