"On the Worst-Case Complexity of TimSort."

Nicolas Auger et al. (2018)
a service of Schloss Dagstuhl - Leibniz Center for Informatics