Sorting a Low-Entropy Sequence
Abstract
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 (S)) be the -order empirical entropy of S, with (n + 1 n ∈ O (m)); our algorithm sorts S using ((H (S) + O (1)) m) comparisons.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.