Abstract
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.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Kaplan, H., Zamir, O., & Zwick, U. (2019). A sort of an adversary. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1291–1310). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975482.79
Readers' Seniority
Readers' Discipline
