🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: comp.lang.misc
Article #4414

Re: GOTO controversy

#4414
From: The Amorphous Mass
Date: Fri, 22 Mar 1996 20:49
18 lines
1610 bytes
On Thu, 21 Mar 1996, Scott Hawley wrote:

> What to you think? Loops without using loops?

  You can certainly use recursion instead of looping iteratively, but 
there are space and time concerns associated with recursion.  Of course, 
there's always tail recursion optimization, which is basically just looping 
behind the programmer's back. :-)  There are a number of languages which use 
recursion and/or generate-and-test paradigms to replace iterative loops 
(mostly logical and functional languages like Lisp, Miranda, Prolog, 
Mercury, ML, Haskell, etc.).
  When I'm programming in C, I tend to use for(;;) and while() and their 
ilk a lot because that's the idiom C uses, and I use recursion only when the 
problem is best expressed recursively.

/**James Robinson***********************            
  "If a fatal error occurs, the program should not be allowed to continue."
 -- Oracle Pro*C User's Guide         *************james-robinson@uiowa.edu**/
Technical Details
Message-ID: <Pine.A32.3.91.960322144138.23347L-100000@red.weeg.uiowa.edu>
Path: arc1-ca.pugleaf.net!red.weeg.uiowa.edu!robinson
References: <314FB5F5.259B@simi.is> <3151B47F.70FD@connix.com>

Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!red.weeg.uiowa.edu!robinson
From: The Amorphous Mass <robinson@blue.weeg.uiowa.edu>
Newsgroups: comp.lang.misc,comp.lang.c,comp.lang.pl1,comp.lang.apl
Subject: Re: GOTO controversy
Date: Fri, 22 Mar 1996 14:49:22 -0600
Organization: University of Iowa, Iowa City, IA, USA
Distribution: world
Message-ID: <Pine.A32.3.91.960322144138.23347L-100000@red.weeg.uiowa.edu>
References: <314FB5F5.259B@simi.is> <3151B47F.70FD@connix.com>
NNTP-Posting-Host: red.weeg.uiowa.edu
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
X-Sender: robinson@red.weeg.uiowa.edu
In-Reply-To: <3151B47F.70FD@connix.com>