An Optimal Deterministic Adversary for Sorting
Source: hexagonmath.org/abs/2611.00196v1
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00196
curl -X POST /api/v1/records/hexagon/2611.00196/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00196/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'