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!j35g2000yqh.googlegroups.com!not-for-mail
From: Adam Beneschan <adam@irvine.com>
Newsgroups: comp.lang.ada
Subject: Re: Invade wikipedia!
Date: Tue, 24 Feb 2009 10:46:11 -0800 (PST)
Organization: http://groups.google.com
Message-ID: 
 <2cb9377f-02c1-4395-84db-b7fbd2bdc577@j35g2000yqh.googlegroups.com>
References: <l6k0og.o0o.ln@hunter.axlog.fr>
 <49a415c4$0$32675$9b4e6d93@newsspool2.arcor-online.net>
	<636a9556-7417-4968-a1f2-8f13a609de40@v39g2000yqm.googlegroups.com>
	<49a43cb5$0$31345$9b4e6d93@newsspool4.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 1235501171 8298 127.0.0.1 (24 Feb 2009 18:46:11
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Tue, 24 Feb 2009 18:46:11 +0000 (UTC)
Complaints-To: groups-abuse@google.com
Injection-Info: j35g2000yqh.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:3768
Date: 2009-02-24T10:46:11-08:00
List-Id: <comp.lang.ada>

On Feb 24, 10:30 am, Georg Bauhaus <rm.dash-bauh...@futureapps.de>
wrote:
> Adam Beneschan schrieb:
>
> >>  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.
>
> I'm not aware of an online description, sorry.
> An example, quickly taken from their making-of manual,
> ishttp://home.arcor.de/bauhaus/Ada/clrs.pdf(36k)
>
> The algorithm has also popped up in the description of the
> notation offered by Google Books' edition of CLRS when gooogling
> "cormen pseudocode notation".

Thanks for the link.  As it turns out, that particular example helps
make my point... you could rewrite that particular piece of pseudocode
in Ada and it would translate directly.  There would be syntax
differences, of course (":=" instead of left-arrow, A'Length instead
of Length[A], "loop" instead of "do", a few others), but it certainly
is *not* a case where any language idiosyncrasies would detract from
the description of the algorithm in a way that pseudo-code wouldn't.

                             -- Adam