Arising from: Mankowitz, D.J., Michi, A., Zhernov, A. et al. Faster sorting algorithms discovered using deep reinforcement learning.Nature 618, 257-263 (2023). doi.org/10.1038/s41586-023-06004-9. The article cited above presents new implementations of sorting algorithms found through deep reinforcement learning that work on a small number of numeric inputs. For 3 numbers, the published implementation contains 17 assembly instructions, and the authors state that no shorter program exists. This note presents two counterexamples for this claim and a straightforward C/C++ implementation that is faster than theirs.

翻译：源自：Mankowitz, D.J., Michi, A., Zhernov, A. 等.《通过深度强化学习发现的更快排序算法》. Nature 618, 257-263 (2023). doi.org/10.1038/s41586-023-06004-9. 上述文章提出了通过深度强化学习发现的、针对少量数字输入的新排序算法实现。对于3个数字，所公布实现包含17条汇编指令，作者称不存在更短的程序。本文对此论断提出两个反例，并给出一个比其更快的直接C/C++实现。