Path: utzoo!attcan!uunet!husc6!uwvax!oddjob!gargoyle!att!ihnp4!ihlpf!nevin1 From: nevin1@ihlpf.ATT.COM (00704a-Liber) Newsgroups: comp.lang.misc Subject: Re: Modern languages (Slight return) Message-ID: <4842@ihlpf.ATT.COM> Date: 24 May 88 00:55:48 GMT References: <3292@enea.se> <2414@uvacs.CS.VIRGINIA.EDU> <2096@ur-tut.UUCP> Reply-To: nevin1@ihlpf.UUCP (00704a-Liber,N.J.) Organization: AT&T Bell Laboratories - Naperville, Illinois Lines: 13 In article <2096@ur-tut.UUCP> pmjc@tut.cc.rochester.edu.UUCP (Pam Arnold) writes: >One advantage I will claim for Modula-2 (and for Pascal as well): I haven't >seen any other languages in which algorithms may be expressed with such >clarity - a terrific plus where maintenance is concerned. I have seen the algorithm for quick sort in a functional language and the n-queens problem solved in Icon using reversible assignment statements; these algorithms are expressed there much more clearly than in Modula-2. -- _ __ NEVIN J. LIBER ..!ihnp4!ihlpf!nevin1 (312) 510-6194 ' ) ) "The secret compartment of my ring I fill / / _ , __o ____ with an Underdog super-energy pill." / (_