<br><br>On Tuesday, March 6, 2012, Pierpaolo Bernardi <<a href="mailto:olopierpa@gmail.com">olopierpa@gmail.com</a>> wrote:<br>> Hello,<br>><br>> I was expecting the procedure 'fa' below to run in constant memory,<br>
> as, in my understanding, It doesn't use any non-tail recursive loops,<br>> it does not build any data structure, and only performs arithmetic<br>> operations on small integers.<br>><br><br>This looks like something out of WPI programming competiton, if I'm not mistaken. :)