User talk:Richss

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Danakil (talk | contribs) at 23:38, 7 September 2004 (Order of prog lang sample implementations in algorithm articles). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Jump to navigation Jump to search

Feel free to say something.

Order of prog lang sample implementations in algorithm articles

Hi, Richss. The articleis about the algorithm not about prog langs, thus the reason why the shortest implementations first. Alphabetical order is good when political correctness or the like are in order. This is not the case. It is not a matter of giving preference to one or another prog lang, it is a matter of keeping the interests of the reader of the article as the main guide. With some of the longest samples among the first, an alphabetical ordering makes it very hard for the article reader to realize that there are vastly different ways of expressing the quicksort algorithm in different prog langs. Just imagine if someone comes with an assembler implementation that takes 200 lines... — danakil 23:38, Sep 7, 2004 (UTC)

Retrieved from "https://en.wikipedia.org/w/index.php?title=User_talk:Richss&oldid=5728585"