How to get rid of StackOverFlow when sorting recursively?

Question

Java

How can I sort an array of, say, 10^6 elements using recursive quick sort? As I understand it, the thread's memory runs out, and it throws an exception. How do they deal with this in Java, or do they just use a different sort?

Answer 1

To do this, use the "springboard" pattern. There is a good implementation example on StackOverflow (alas, the text is in English):
stackoverflow.com/a/32909860/1293168

Answer 2

It is not necessary to use the system call stack as the "stack". You can use a loop instead of recursion, and use a stack in your programming language library instead of the system call stack. Instead of a recursive call, you will have to put a tuple of values ​​- sorting parameters - on the stack and extract them from there at the next processing step.