论文标题
校正：实用的，可证明的线性时间，原地和稳定的合并算法，通过完美的混音
Correction to: A Practical, Provably Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle
论文作者
论文摘要
我们纠正了以前提交给Corr的论文。该论文声称所描述的算法在平均情况下证明是线性时间复杂性的。所谓的该陈述的证据包含一个错误，基于一个无效的假设，并且无效。在本文中，我们介绍了实验和分析证据，表明平均情况下的时间复杂性是$ n^2 $的顺序，其中$ n $是合并序列的总长度。
We correct a paper previously submitted to CoRR. That paper claimed that the algorithm there described was provably of linear time complexity in the average case. The alleged proof of that statement contained an error, being based on an invalid assumption, and is invalid. In this paper we present both experimental and analytical evidence that the time complexity is of order $N^2$ in the average case, where $N$ is the total length of the merged sequences.
