涌现排序：用简单局部算子收敛到有序序列
Emerge-Sort: Converging to Ordered Sequences by Simple Local Operators
摘要：
在本文中，我们研究排序的假设，我们不知道在事先以何种方式排序的数字序列，我们在工作中设置简单的本地比较和交换操作符，其重复应用程序最终在排序序列。这些都是涌现排序的基本要素，我们的方法来自组织排序，然后我们在一系列样本的实验验证。观察一个O（n2）运行时的行为，我们注意到，n/logn延迟系数，区分紧急排序从经典的比较为基础的算法是一个无政府状态的无政府代价，我们支付不强加排序顺序，并让该顺序出现通过本地的相互作用的实例。
英文摘要：
In this paper we examine sorting on the assumption that we do not know in advance which way to sort a sequence of numbers and we set at work simple local comparison and swap operators whose repeating application ends up in sorted sequences. These are the basic elements of Emerge-Sort, our approach to self-organizing sorting, which we then validate experimentally across a range of samples. Observing an O(n2) run-time behaviour, we note that the n/logn delay coefficient that differentiates Emerge-Sort from the classical comparison based algorithms is an instantiation of the price of anarchy we pay for not imposing a sorting order and for letting that order emerge through the local interactions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
