Sort allocation at all levels?
Looking a bit more into the memory consumption and the sort tasks. We seem to allocate the sort
array at multiple levels in the tree. Specifically, from the super
level to the leaf level. Is that all necessary?
Can't we at least stop below the level where no PAIR task will ever recurse? Can't we even live with one single sort array for all the levels?