We describe an efficient deterministic adversary that forces any comparison-based sorting algorithm to perform at least3764 n log n comparisons. This improves on previous efficient adversaries of Atallah and Kosaraju (1981), Richards and Vaidya (1988), and of Brodal et al. (1996) that force any sorting algorithm to perform at least12 n log n comparisons.
|Number of pages||20|
|State||Published - 2019|
|Event||30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States|
Duration: 6 Jan 2019 → 9 Jan 2019
|Conference||30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019|
|Period||6/01/19 → 9/01/19|