Re: Invade wikipedia!

[Adam Beneschan <adam@irvine.com>]

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