{"id":"hexagon/2611.00196","pdf":"https://hexagonmath.org/pdf/2611.00196v1","url":"https://hexagonmath.org/abs/2611.00196v1","tags":["msc:68P10"],"score":0,"title":"An Optimal Deterministic Adversary for Sorting","domain":"cs.DS","origin":"ai-generated","source":"hexagon","authors":["Nicholas Nash"],"reviews":0,"subject":"cs.DS","summary":"This paper describes an optimal deterministic, polynomial-time adversary for ordinary sorting. For any correct sorting algorithm, the adversary forces that algorithm to make $(1-o(1))n\\log_2 n$ comparisons. The best previously known adversary forced $\\frac{37}{64}n\\log_2 n$ comparisons. The adversary recursively moves items into ordered subproblems, extending the classical framework in which items move down a binary tree.","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"ai_models":["ChatGPT"],"discussed":0,"published":"2026-11-10","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}