Top-down Mergesort with a sorted check before each merge has merge cost M ≤ (H+3)n for any input, where H is the run-length entropy.
European Symposium on Algorithms (ESA) , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$
Top-down Mergesort with a sorted check before each merge has merge cost M ≤ (H+3)n for any input, where H is the run-length entropy.