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-Thread: 103376,587e0e0a16d65b10
X-Google-Attributes: gid103376,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news4.google.com!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Tue, 24 Feb 2009 16:44:03 +0100
From: Georg Bauhaus <rm.dash-bauhaus@futureapps.de>
User-Agent: Thunderbird 2.0.0.19 (Macintosh/20081209)
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Invade wikipedia!
References: <l6k0og.o0o.ln@hunter.axlog.fr>
In-Reply-To: <l6k0og.o0o.ln@hunter.axlog.fr>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Message-ID: <49a415c4$0$32675$9b4e6d93@newsspool2.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 24 Feb 2009 16:44:04 CET
NNTP-Posting-Host: c9113f54.newsspool2.arcor-online.net
X-Trace: 
 DXC=:Q;YmfGgR;;=FQB?mjjV50A9EHlD;3Yc24Fo<]lROoR1^YC2XCjHcb9K[2BKCaJ40=;9OJDO8_SK6NSZ1n^B98i:m1[AXA1nNX?
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news1.google.com comp.lang.ada:3757
Date: 2009-02-24T16:44:04+01:00
List-Id: <comp.lang.ada>

Jean-Pierre Rosen schrieb:
> I was musing recently through Wikipedia. There are lots of topics
> related to algorithms or similar stuff that have examples, generally in
> C, often with examples in some other languages for comparison.
> 
> It would be nice if the community joined forces to add Ada examples.
> Nobody can do that alone, but if everyone add some examples when finding
> an opportunity, we could give much more visibility to Ada.


>From the point of view of Wikipedia, topics related to
algorithms should really not use a programming language.
Any specific language has idiosyncrasies that distract
from the topic of algorithms.  Specific languages can only
be justified if the implementation matters. (This is also
approach in Knuth's TAOCP.)

So, for rewriting algorithm examples there is a well
specified and well established pseudo code notation,
to be found in

 Cormen/Leiserson/Rivest/Stein (2001):
 Introduction to Algorithms, Second Edition.

The notation used there is becoming more popular.

But then, when implementation matters, one could always
show how Ada helps with getting details right and readable.

--
Avoid Ada hype.  -- RBKD at MIT, ~2005