Currently a sparse array (an array containing empty slots in between) cannot be sorted.
It would be great, if sort/sortWith could be changed to allow sorting sparse arrays.
The result could be either a condensed array in sorted order (having all empty slots removed) or the original size, where the sorted items are stored from index 1 on up.
Anonymous
This does not make any sense. The effect of how sparse elements should be handled in
a sorting context really does not make any sense. This will not be implemented.