修正：一个实用的，可证明的线性时间，原地和稳定的合并算法，通过完美的洗牌
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
