按位置和班次排序
Sorting by Placement and Shift
摘要：
在每个项目的最终目的地是已知的排序情况下，很自然地重复选择项目并将其放置在它们所属的地方，允许插入的项目移动一个以腾出空间。(In事实上，这种算法的一个特例通常用于手动排序文件。）然而，该算法必然终止并不明显。我们表明，事实上，该算法终止后，在最坏的情况下，在最多$2^{n-1}-1$步骤（证实了L. Larson），并且有超指数的许多排列可以达到这个精确的界限。这个证明涉及到一个奇怪的对称二进制表示。
英文摘要：
In sorting situations where the final destination of each item is known, it is natural to repeatedly choose items and place them where they belong, allowing the intervening items to shift by one to make room. (In fact, a special case of this algorithm is commonly used to hand-sort files.) However, it is not obvious that this algorithm necessarily terminates. We show that in fact the algorithm terminates after at most $2^{n-1}-1$ steps in the worst case (confirming a conjecture of L. Larson), and that there are super-exponentially many permutations for which this exact bound can be achieved. The proof involves a curious symmetrical binary representation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
