3 ms·

Fibonacci isn't a kind of problem that should be bounded on RAM though. Something is fundamentally broken with the way this is implemented.

• jcdavis 15y ago
  Sure it is. Stack space isn't free
  • jamwt 15y ago
    It is with TCO.
    • jcdavis 15y ago
      How exactly is the particular implementation in question tail-call optimized? Honest question, not trying to be snarky. I'm well aware that fib can be done to use TCO, but this doesn't appear to do so