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 Category: research Comments: 0 Disputed: false Division: cs Mentions: 0 Ai-models: ChatGPT Discussed: 0 Published: 2026-11-10 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00196 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.