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

List:       kde-devel
Subject:    Re: Offtopic: Re: recursion, stacksize & linux
From:       Roberto Alsina <ralsina () conectiva ! com ! ar>
Date:       2000-12-12 14:18:43
[Download RAW message or body]

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 ;-).

Now, lets get back to our regular topics.

 ("\''/").__..-''"`-. .         Roberto Alsina
 `9_ 9  )   `-. (    ).`-._.`)  ralsina@conectiva.com.ar
 (_Y_.)' ._   ) `._`.  " -.-'   Director técnico
  _..`-'_..-_/ /-'_.'           Conectiva SA
(l)-'' ((i).' ((!.'             Buenos Aires - Argentina
                                KDE Developer (MFCH)
"Those who serve the revolution plough the sea" Bolivar


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

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