Sorting a Low-Entropy Sequence

Simple item page
dc.creatorGagie, Travis
dc.date2005-06-08
dc.date.accessioned2026-07-07T03:23:06Z
dc.date.available2026-07-07T03:23:06Z
dc.descriptionWe give the first sorting algorithm with bounds in terms of higher-order entropies: let $S$ be a sequence of length $m$ containing $n$ distinct elements and let (H_\ell (S)) be the $\ell$th-order empirical entropy of $S$, with (n^{\ell + 1} \log n \in O (m)); our algorithm sorts $S$ using ((H_\ell (S) + O (1)) m) comparisons.
dc.identifierhttps://arxiv.org/abs/cs/0506027
dc.identifierhttp://arxiv.org/abs/cs/0506027
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32811
dc.subjectData Structures and Algorithms
dc.subjectE.4; E.5
dc.titleSorting a Low-Entropy Sequence
dc.typetext

Files

Collections

arXiv