From: depthought AT aol DOT com (DepThought)
Newsgroups: comp.os.msdos.djgpp
Subject: Re: Linked lists
Date: 29 Mar 1998 15:04:38 GMT
Lines: 20
Message-ID: <1998032915043801.KAA29888@ladder03.news.aol.com>
NNTP-Posting-Host: ladder03.news.aol.com
References: <3515B2A7 DOT B238AA6B AT concentric DOT net>
Organization: AOL http://www.aol.com
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Precedence: bulk

In article <3515B2A7 DOT B238AA6B AT concentric DOT net>, "D. Huizenga"
<skis AT concentric DOT net> writes:

>Date:	Sun, 22 Mar 1998 19:54:00 -0500
>
>A small note: 
>
> Besides having the advantage of
> being able to access the variable outside of the
> loop, according to a previouse thread in this group
> the second way has the added advantage of being
> much faster than the first. If I remember coorectly,
> this is because the variable is declared only once,
> opposed to being declared newly each time the code
> goes back to the top of the loop.
>
>

The above caveat applies to NESTED loops, due to time to reallocate 2d index
over and over again. I don't believe it applies to the current example