On Tuesday, March 6, 2012, Pierpaolo Bernardi <olopie...@gmail.com> wrote: > Hello, > > I was expecting the procedure 'fa' below to run in constant memory, > as, in my understanding, It doesn't use any non-tail recursive loops, > it does not build any data structure, and only performs arithmetic > operations on small integers. >
This looks like something out of WPI programming competiton, if I'm not mistaken. :)
____________________ Racket Users list: http://lists.racket-lang.org/users
