Sorting a Low-Entropy Sequence
数据结构与算法
2007-05-23 v1
摘要
We give the first sorting algorithm with bounds in terms of higher-order entropies: let be a sequence of length containing distinct elements and let (H_\ell (S)) be the th-order empirical entropy of , with (n^{\ell + 1} \log n \in O (m)); our algorithm sorts using ((H_\ell (S) + O (1)) m) comparisons.
引用
@article{arxiv.cs/0506027,
title = {Sorting a Low-Entropy Sequence},
author = {Travis Gagie},
journal= {arXiv preprint arXiv:cs/0506027},
year = {2007}
}