zSort is a stable distribution sort using z-score partitioning that achieves up to 4.5x speedup over comparison-based stable sorts while matching unstable algorithms like Skasort on many inputs.
https://en.cppreference.com/w/cpp/ algorithm/stable_sort.html (accessed Mar, 2026)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
zSort: Stable Distribution Sort using Z-Score Partitioning
zSort is a stable distribution sort using z-score partitioning that achieves up to 4.5x speedup over comparison-based stable sorts while matching unstable algorithms like Skasort on many inputs.