Re: GOTO controversy

Article View: comp.lang.misc

Article #4424

#4424

From: Lawrence Kirby
Date: Wed, 03 Apr 1996 16:40

15 lines
1272 bytes

In article <AD87DB279668D9F74@mcdiala15.it.luc.edu>
           VArase@varase.it.luc.edu "Verne Arase" writes:

>Recursion can make for visually appealing and simplified code, but in real
>terms they're nothing but trouble unless you can absolutely positively
>guarantee a finite, known level stack depth.

An O(log N) stack depth is generally not a problem. I guess you could say
that is finite because there are typically practical upper bounds to N.

-- 
-----------------------------------------
Lawrence Kirby | fred@genesis.demon.co.uk
Wilts, England | 70734.126@compuserve.com
-----------------------------------------

Technical Details

Message-ID: <828549619snz@genesis.demon.co.uk>

Path: arc1-ca.pugleaf.net!mail2news.demon.co.uk!genesis.demon.co.uk

References:

<314FB5F5.259B@simi.is> <3151B47F.70FD@connix.com> <4jo5t6$1ki@socrates.moe.edu.sg> <4jq2en$g2q@news.cais.com> <AD87DB279668D9F74@mcdiala15.it.luc.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!mail2news.demon.co.uk!genesis.demon.co.uk
From: Lawrence Kirby <fred@genesis.demon.co.uk>
Newsgroups: comp.lang.misc,comp.lang.c,comp.lang.pl1,comp.lang.apl
Subject: Re: GOTO controversy
Date: Wed, 03 Apr 96 16:40:19 GMT
Organization: none
Message-ID: <828549619snz@genesis.demon.co.uk>
References: <314FB5F5.259B@simi.is> <3151B47F.70FD@connix.com> <4jo5t6$1ki@socrates.moe.edu.sg> <4jq2en$g2q@news.cais.com> <AD87DB279668D9F74@mcdiala15.it.luc.edu>
Reply-To: fred@genesis.demon.co.uk
X-NNTP-Posting-Host: genesis.demon.co.uk
X-Newsreader: Demon Internet Simple News v1.27
X-Mail2News-Path: genesis.demon.co.uk

Reply to Parent Message