https://gcc.gnu.org/bugzilla/show_bug.cgi?id=123082
--- Comment #4 from Jakub Jelinek <jakub at gcc dot gnu.org> --- In any case, wonder if really the compiler should fix up for badly written sort algorithms like this, normal way would be to allocate the extra memory (through VLA or heap allocation if larger than some constant) in the outermost call and use that buffer then in the recursive calls.
