We study self-improving sorting with hidden partitions. Our result is an optimal algorithm which runs in expected time O(H(\pi(I)) + n), where I is the given input which contains n elements to be sorted, \pi(I) is the output which are the ranks of all element in I, and H(\pi(I)) denotes the entropy of the output.
@article{arxiv.1902.00219,
title = {A note on self-improving sorting with hidden partitions},
author = {Siu-Wing Cheng and Man-Kwun Chiu and Kai Jin},
journal= {arXiv preprint arXiv:1902.00219},
year = {2019}
}