Albert Tedja

Sorting Lists with Equal Keys Using Mergesort in Linear Time

2020 · arXiv (Cornell University)

This article introduces a new optimization method to improve mergesort's runtime complexity, when sorting sequences that have equal keys to $O(n log_2 k)$, where $k$ is the number of distinct keys in the sequence. When …