You are reading a single comment by @Gordon and its replies. Click here to read the full conversation.
  • The issue really is stack space. As the parse tree is effectively on the stack, having two things running concurrently is likely to fill it up pretty quick. You could just rewrite the quicksort to jump out early.

    Can you post your quicksort? I'd like to add it as a benchmark.

    The best solution here would be to implement the quicksort natively though. It should be quite easy (and fast) with iterators and I imagine it would be used a lot.


Avatar for Gordon @Gordon started