4 ms·
Your recursive merge function will blow the stack for large inputs and it will be slow.
by Scarbutt 7y ago
Your recursive merge function will blow the stack for large inputs and it will be slow.
- lidHanteyk 7y agoA balanced tree big enough to blow the stack will also blow out RAM; Haskell couldn't handle it either. Check on the back of your napkin. I understand your desire to point out a classic memetic weakness of Python vs. Haskell, but your point is spurious because of actual real-world constraints.