2 ms·

loops into queues? Control flow into a data structure? If you're gonna a make a 'sufficiently smart compiler' argument, get it right. I think you meant "tail c

• zandorg 16y ago
  Well, when I want to convert a function that uses recursion but the stack isn't big enough, I make it have a queue where each new item goes on the end, and the next item goes from the front of the queue. This way the stack is replaced by the heap (which is much bigger!).