Sorting a Low-Entropy Sequence

Details Sorting a Low-Entropy Sequence Sorting a Low-Entropy Sequence

2005-06-08

arxiv.org/abs/cs/0506027v1

Computer Science

Data Structures and Algorithms

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

Sorting a Low-Entropy Sequence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sorting a Low-Entropy Sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorting a Low-Entropy Sequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170360