[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-devel
Subject:    Re: Offtopic: Re: recursion, stacksize & linux
From:       David van Hoose <david-vh () home ! com>
Date:       2000-12-12 16:29:20
[Download RAW message or body]

Roberto Alsina wrote:
> 
> On Tue, 12 Dec 2000, Leon Widdershoven wrote:
> 
> > I didn't have such a course, but I can imagine that it
> > is always possible (though not necesarilly trivial).
> >
> > A recursion is, by definition, doing 'the same' over and
> > over again until some end-value (predefined value, I do not
> > know the correct terminology) is encountered.
> > I think this could (almost) always be done in a
> > while( parameter != boundary_condition ) type loop.
> >
> > If such is not the case I would be interested why not.
> 
> People: everything gets implemented in assembler. Everything you can do
> can be done using nothing but if,goto and consecutive instruction
> execution (thats a theorem ;-).

No.. That is a law. :-)
It may get complicated, but there is no instance in which you cannot do
it.

-- 
-Dave
 
>> Visit http://master.kde.org/mailman/listinfo/kde-devel#unsub to unsubscribe <<

[prev in list] [next in list] [prev in thread] [next in thread]