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!postnews.google.com!v39g2000yqm.googlegroups.com!not-for-mail From: Adam Beneschan Newsgroups: comp.lang.ada Subject: Re: Invade wikipedia! Date: Tue, 24 Feb 2009 08:52:54 -0800 (PST) Organization: http://groups.google.com Message-ID: <636a9556-7417-4968-a1f2-8f13a609de40@v39g2000yqm.googlegroups.com> References: <49a415c4$0$32675$9b4e6d93@newsspool2.arcor-online.net> NNTP-Posting-Host: 66.126.103.122 Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit X-Trace: posting.google.com 1235494375 18482 127.0.0.1 (24 Feb 2009 16:52:55 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Tue, 24 Feb 2009 16:52:55 +0000 (UTC) Complaints-To: groups-abuse@google.com Injection-Info: v39g2000yqm.googlegroups.com; posting-host=66.126.103.122; posting-account=duW0ogkAAABjRdnxgLGXDfna0Gc6XqmQ User-Agent: G2/1.0 X-HTTP-UserAgent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.7.12) Gecko/20050922 Fedora/1.7.12-1.3.1,gzip(gfe),gzip(gfe) Xref: g2news1.google.com comp.lang.ada:3762 Date: 2009-02-24T08:52:54-08:00 List-Id: On Feb 24, 7:44 am, Georg Bauhaus wrote: > 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. Is this a (somewhat) standardized enough notation that it's described online somewhere? If so, where? I don't have the CLRS book handy and I'm certainly not going to buy it just to see what the pseudo-code notation looks like. In any case, though, I'd expect that Ada (as well as Pascal or other languages that can claim Algol as an ancestor) would be close enough to what we expect "pseudo"-code to look like, that there shouldn't be much issue with language idiosyncrasies. Just my uninformed opinion--- there could be some language-specific aspects that would get in the way; I haven't looked at the referenced Wikipedia articles, given that I have approximately as much time as Bill to work on this. -- Adam