A note on self-improving sorting with hidden partitions
arXiv:1902.00219
Abstract
We study self-improving sorting with hidden partitions. Our result is an optimal algorithm which runs in expected time O(H(π(I)) + n), where I is the given input which contains n elements to be sorted, π(I) is the output which are the ranks of all element in I, and H(π(I)) denotes the entropy of the output.
4pages