We haven't resolved whether the number of steps needed to sort any list of items can always be reduced below current theoretical best-known limits.
open
Global / Unspecified, Global
WS01258
Sorting algorithms have been optimized extensively, but proving a true absolute lower bound across all possible sorting methods remains an unresolved question in computational theory. This affects the fundamental efficiency limits of computing.