Re: Invade wikipedia!

["Hibou57 (Yannick Duchêne)" <yannick_duchene@yahoo.fr>]

On 24 fév, 16:44, Georg Bauhaus <rm.dash-bauh...@futureapps.de> wrote:
> 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

This is not just a matter of implementation, it is also a matter of
precision.

If this kind of pseudo code was suffiscient to really and precisely
express algorithms, it would be a real language.

There is an exception about declarative languages, like part of the
mathematical one, beceause these ones express properties.

There is alaways some lacks and this pseudo-code has nothing better
than others. This is just a discret way to claim one langage is better
to another.... pseudo-code is a langage, beside any other one, and I
do not see a way it is better to any other one at expressing
algorithms.

Pseudo-code is commonly used in a loosy way (I do not mean it is a bad
thing) which could not work at all if one would try to map it in an
"implementation langage". Otherwise, it is a competitor which
errorneously claim to be the only one to be better than any one else.

And indeed, it is a good idea to not talk about algorithms using a
particular "implementation language", beceause algorithms are better
discussed using declarative meanings (implementation decision as well,
should be disccused using declarative meanings).