Sometimes we need to deal with huge arrays, in which case we risk overflowing the stack by using Quicksort-based techniques whose space complexity is O(ln(n)) due to its recursive call stack. It is possible yet tricky to perform sorting with constant space and decent performance, i.e. O(n*ln(n)*ln(n)) or better, so I think the standard library could provide a `sort_const_space`

method on `slice`

.

What are your thoughts? Would you prefer an extra method in the standard library or a separate crate? Which exact algorithm do you propose for this task?